See this document in CiteSeerX!

Exploiting Upper and Lower Bounds in Top-Down Query Optimization (2001)  (Make Corrections)  (1 citation)
Leonard Shapiro, David Maier, Paul Benninghoff, Keith Billings
International Database Engineering and Application Symposium



  Home/Search   Context   Related

 
View or download:
pdx.edu/~len/IDEAS01.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pdx.edu/~len/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: System Rs bottom-up query optimizer architecture forms the basis of most current commercial database managers. This paper compares the performance of topdown and bottom-up optimizers, using the measure of the number of plans generated during optimization. Top down optimizers are superior according to this measure because they can use upper and lower bounds to avoid generating groups of plans. Early during the optimization of a query, a top-down optimizer can derive upper bounds for the costs of ... (Update)

Cited by:   More
Distributed Queries without Distributed State - Vassilis Papadimos David (2002)   (Correct)

Active bibliography (related documents):   More   All
2.5:   Exploiting Upper and Lower Bounds in Top-Down Query.. - Shapiro, Maier.. (2001)   (Correct)
1.5:   Efficiency In The Columbia Database Query Optimizer - Xu (1998)   (Correct)
0.7:   Unknown - Top-Down Query Optimizers   (Correct)

Similar documents based on text:   More   All
0.6:   Selected Research Issues in Decision Support Databases - Maier, Meredith, Shapiro (1998)   (Correct)
0.5:   Secure Mobile Networking - 12th Quarterly Report - Binkley, McHugh (1998)   (Correct)
0.4:   Materialized View Algorithms - Fan (1997)   (Correct)

BibTeX entry:   (Update)

Leonard D. Shapiro, David Maier, Paul Benninghoff, Keith Billings, Yubo Fan, Kavita Hatwal, Quan Wang, Yu Zhang, Hsiao min Wu, and Bennet Vance. Exploiting upper and lower bounds in top-down query optimization. In Proceedings of IDEAS '01, pages 20--33, 2001. http://citeseer.ist.psu.edu/shapiro01exploiting.html   More

@inproceedings{ shapiro01exploiting,
    author = "Leonard D. Shapiro and David Maier and Paul Benninghoff and Keith Billings and Yubo Fan and Kavita Hatwal and Quan Wang and Yu Zhang and Hsiao-min Wu and Bennet Vance",
    title = "Exploiting Upper and Lower Bounds In Top-Down Query Optimization",
    booktitle = "International Database Engineering and Application Symposium",
    pages = "20-33",
    year = "2001",
    url = "citeseer.ist.psu.edu/shapiro01exploiting.html" }
Citations (may not include all citations):
782   Prentice Hall Series in Artificial Intelligence (context) - Russel, Norvig et al. - 1995
408   Princeton University Press (context) - Bellman, Programming - 1975
389   Access Path Selection in a Relational Database Management Sy.. (context) - Selinger, Astrahan et al. - 1979
187   Optimizing Queries Across Diverse Data Sources - Haas, Kossman et al. - 1997
129   Starburst MidFlight: as the Dust Clears (context) - Haas, Chang et al. - 1990
122   Database Management Systems (context) - Ramakrishnan, Gehrke - 2000
106   The EXODUS Optimizer Generator - Graefe, DeWitt - 1987
104   The Volcano Optimizer Generator: Extensibility and Efficient.. - Graefe, McKenna - 1993
74   Memo Functions and Machine Learning (context) - Michie - 1968
67   Grammar-like Functional Rules for Representing Query Optimiz.. (context) - Lohman - 1988
64   Measuring the Complexity of Join Enumeration in Query Optimi.. (context) - Ono, Lohman - 1990
34   Rapid Bushy Join-order Optimization with Cartesian Products - Vance, Maier - 1996
31   Control of an Extensible Query Optimizer: A Planning-Based A.. - Mitchell, Dayal et al. - 1993
22   An Incremental Join Attachment for Starburst (context) - Carey, Shekita et al. - 1990
17   The Complexity of Transformation-Based Join Enumeration - Pellenkoft, Galindo-Legaria et al. - 1997
17   an object-oriented implementation for extensible database qu.. (context) - Kabra, DeWitt - 1999
12   Efficient Search in Extensible Database Query Optimization: .. (context) - McKenna - 1993
9   EROC: A Toolkit for Building NEATO Query Optimizers - McKenna, Burger et al. - 1996
6   The Query Optimizer in Tandem s ServerWare SQL Product (context) - Celis - 1996
4   The Microsoft Relational Engine (context) - Graefe - 1996
4   Bulletin of the IEEE Technical Committee on Data Engineering (context) - Graefe, Framework et al. - 1995
4   Model for Database Query Optimization in Cascades (context) - Billings, TPC-D - 1997
3   A Region Based Query Optimizer through Cascades Optimizer Fr.. (context) - Ozcan, Nural et al. - 1995
3   Query Optimization in IBM's DB2 Family of DBMSs (context) - Gassner, Lohman et al. - 1993
2   Selected Research Issues in Decision Support Databases - Maier, Meredith et al. - 1998

Documents on the same site (http://www.cs.pdx.edu/~len/):   More
Efficiency In The Columbia Database Query Optimizer - Xu (1998)   (Correct)
Materialized View Algorithms - Fan (1997)   (Correct)
Selected Research Issues in Decision Support Databases - Maier, Meredith, Shapiro (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC