A new approach to join reordering in query optimization
A major task in query optimization is finding an optimal or near-optimal order to perform join operations. Most optimizers perform this join reordering using an exhaustive search algorithm with a dynamic programming technique. This algorithm always gives the optimal join ordering, but is very expens...
Main Author: | Pilehvar, Mostafa |
---|---|
Format: | Others |
Published: |
2005
|
Online Access: | http://spectrum.library.concordia.ca/8257/1/MR04207.pdf Pilehvar, Mostafa <http://spectrum.library.concordia.ca/view/creators/Pilehvar=3AMostafa=3A=3A.html> (2005) A new approach to join reordering in query optimization. Masters thesis, Concordia University. |
Similar Items
Efficient Processing of Skyline Queries in Aggregate-Join with Constraints
by: 林靖琨
Published: (2016)
by: 林靖琨
Published: (2016)
Similar Items
-
Optimization of Queries with Fragmented Relations and Large Join Queries
by: Chun-Xian Chang, et al.
Published: (1995) -
Optimization for Multi-Join Queries on the GPU
by: Xue-Xuan Hu, et al.
Published: (2020-01-01) -
Efficient algorithms for optimizing large join queries
by: Huang, Shang Yi, et al.
Published: (1995) -
Answering Join Queries Instantly
by: Hamdi, Mohammed
Published: (2018) -
Multidatabase query optimization using sort-hash-merge join algorithm
by: Zhang, Zhe-Bin, et al.
Published: (1997)