Literature for Query Optimization: Past to Present


Link to the Homepage: Query Optimization: Past to Present


no image available Cluet, Sophie and Moerkotte, Guido
On the complexity of generating optimal left-deep processing trees with cross products
ICDT 1995
no image available DeHaan, David and Tompa, Frank Wm.
Optimal top-down join enumeration
SIGMOD 2007
no image available Fender, Pit and Moerkotte, Guido
A new, highly efficient, and easy to implement top-down join enumeration algorithm
IEEE 2011
no image available Haffner, Immanuel and Dittrich, Jens
Efficiently computing join orders with heuristic search
SIGMOD 2023
no image available Ibaraki, Toshihide and Kameda, Tiko
On the optimal nesting order for computing N-relational joins
ACM Transactions on Database Systems 1984
no image available Krishnamurthy, Ravi; Boral, Haran and Zaniolo, Carlo
Optimization of nonrecursive queries
MCC 1986
no image available Moerkotte, Guido and Neumann, Thomas
Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products
VLDB 2006
no image available Neumann, Thomas
Query simplification:
Graceful degradation for join-order optimization
SIGMOD 2009
no image available Neumann, Thomas and Radke, Bernhard
Adaptive optimization of very large join queries
SIGMOD 2018
no image available Ono, Kiyoshi and Lohman, Guy M.
Measuring the complexity of join enumeration in query optimization
IBM 1990
no image available Selinger, P. Griffiths et al.
Access path selection in a relational database management system
SIGMOD 1979
no image available Steinbrunn, Michael; Moerkotte, Guido and Kemper, Alfons
Heuristic and randomized optimization for the join ordering problem
The VLDB Journal 1997
no image available Vance, Bennet and Maier, David
Rapid bushy join-order optimization with Cartesian products
ACM SIGMOD 1996