Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/564691.564766acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

Learning table access cardinalities with LEO

Published: 03 June 2002 Publication History
  • Get Citation Alerts
  • Abstract

    LEO is a comprehensive way to repair incorrect statistics and cardinality estimates of a query execution plan. LEO introduces a feedback loop to query optimization that enhances the available information on the database where the most queries have occurred, allowing the optimizer to actually learn from its past mistakes. We demonstrate how LEO learns outdated table access statistics on a TPC-H like database schema and show that LEO improves the estimates for table cardinalities as well as filter factors for single predicates. Thus LEO enables the query optimizer to choose a better query execution plan, resulting in more efficient query processing. We not only demonstrate learning by repetitive execution of a single query, but also illustrate how similar, but not identical queries benefit from learned knowledge. In addition, we show the effect of both learning cardinalities and adjusting related statistics.

    Cited By

    View all
    • (2021)Expand your Training Limits! Generating Training Data for ML-based Data ManagementProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457286(1865-1878)Online publication date: 9-Jun-2021
    • (2015)Forecasting the cost of processing multi-join queries via hashing for main-memory databasesProceedings of the Sixth ACM Symposium on Cloud Computing10.1145/2806777.2806944(153-166)Online publication date: 27-Aug-2015
    • (2011)Aggregation strategies for columnar in-memory databases in a mixed workloadProceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management10.1145/2065003.2065015(51-58)Online publication date: 28-Oct-2011
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of data
    June 2002
    654 pages
    ISBN:1581134975
    DOI:10.1145/564691
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 June 2002

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    SIGMOD/PODS02

    Acceptance Rates

    SIGMOD '02 Paper Acceptance Rate 42 of 240 submissions, 18%;
    Overall Acceptance Rate 785 of 4,003 submissions, 20%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Expand your Training Limits! Generating Training Data for ML-based Data ManagementProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457286(1865-1878)Online publication date: 9-Jun-2021
    • (2015)Forecasting the cost of processing multi-join queries via hashing for main-memory databasesProceedings of the Sixth ACM Symposium on Cloud Computing10.1145/2806777.2806944(153-166)Online publication date: 27-Aug-2015
    • (2011)Aggregation strategies for columnar in-memory databases in a mixed workloadProceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management10.1145/2065003.2065015(51-58)Online publication date: 28-Oct-2011
    • (2010)Autonomic View of Query Optimizers in Database Management SystemsProceedings of the 2010 Eighth ACIS International Conference on Software Engineering Research, Management and Applications10.1109/SERA.2010.11(3-8)Online publication date: 24-May-2010
    • (2010)Managing dynamic mixed workloads for operational business intelligenceProceedings of the 6th international conference on Databases in Networked Information Systems10.1007/978-3-642-12038-1_2(11-26)Online publication date: 29-Mar-2010
    • (2009)Managing operational business intelligence workloadsACM SIGOPS Operating Systems Review10.1145/1496909.149692743:1(92-98)Online publication date: 1-Jan-2009
    • (2009)Predicting Multiple Metrics for QueriesProceedings of the 2009 IEEE International Conference on Data Engineering10.1109/ICDE.2009.130(592-603)Online publication date: 29-Mar-2009
    • (2009)Benchmarking Query Execution RobustnessPerformance Evaluation and Benchmarking10.1007/978-3-642-10424-4_12(153-166)Online publication date: 28-Oct-2009
    • (2008)Optimizer plan change managementProceedings of the VLDB Endowment10.14778/1454159.14541751:2(1346-1355)Online publication date: 1-Aug-2008
    • (2007)Cardinality estimation using sample views with quality assuranceProceedings of the 2007 ACM SIGMOD international conference on Management of data10.1145/1247480.1247502(175-186)Online publication date: 11-Jun-2007

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media