Tighter Upper Bounds for Join Cardinality Estimates
Author: 
Walter CaiAuthors Info & Claims
Walter CaiAuthors Info & ClaimsPages 1805 - 1807
References
[1]
Michael Armbrust, Kristal Curtis, Tim Kraska, Armando Fox, Michael J. Franklin, and David A. Patterson. 2011. PIQL: Success-Tolerant Query Processing in the Cloud. CoRR abs/1111.7166 (2011). arXiv:1111.7166 http://arxiv.org/abs/1111.7166
[2]
Albert Atserias, Martin Grohe, and DÃaniel Marx. 2013. Size Bounds and Query Plans for Relational Joins. SIAM J. Comput. 42, 4 (2013), 1737--1767. arXiv:https://doi.org/10.1137/110859440
[3]
Brian Babcock and Surajit Chaudhuri. 2005. Towards a Robust Query Optimizer: A Principled and Practical Approach. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (SIGMOD '05). ACM, New York, NY, USA, 119--130.
[4]
Shivnath Babu, Pedro Bizarro, and David DeWitt. 2005. Proactive Re-optimization. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (SIGMOD '05). ACM, New York, NY, USA, 107--118.
[5]
Yu Chen and Ke Yi. 2017. Two-Level Sampling for Join Size Estimation. In Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD '17). ACM, New York, NY, USA, 759--774.
[6]
Google. 2017. GooglePlus. https://plus.google.com/
[7]
Srikanth Kandula, Anil Shanbhag, Aleksandar Vitorovic, Matthaios Olma, Robert Grandl, Surajit Chaudhuri, and Bolin Ding. 2016. Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters. In Proceedings of the 2016 International Conference on Management of Data (SIGMOD '16). ACM, New York, NY, USA, 631--646.
[8]
Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2016. What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR abs/1612.02503 (2016). arXiv:1612.02503 http://arxiv.org/abs/1612. 02503
[9]
Viktor Leis, Andrey Gubichev, Atanas Mirchev, Peter Boncz, Alfons Kemper, and Thomas Neumann. 2015. How Good Are Query Optimizers, Really? Proc. VLDB Endow. 9, 3 (Nov. 2015), 204--215.
[10]
Viktor Leis, Bernharde Radke, Andrey Gubichev, Alfons Kemper, and Thomas Neumann. 2017. Cardinality Estimation Done Right: Index-Based Join Sampling. In CIDR.
[11]
Postgres Development Core Team. 2017. PostgreSQL. https://www.postgresql.org/
[12]
David Vengerov, Andre Cavalheiro Menck, Mohamed Zait, and Sunil Chakkappen. 2015. Join Size Estimation Subject to Filter Conditions. PVLDB 8 (2015), 1530--1541.
Index Terms
- Tighter Upper Bounds for Join Cardinality Estimates
Recommendations
Improved upper bounds on sizes of codes
Let A(n,d) denote the maximum possible number of codewords in a binary code of length n and minimum Hamming distance d. For large values of n, the best known upper bound, for fixed d, is the Johnson bound. We give a new upper bound which is at least as ...
BoundEst: Estimating Join Cardinalities with Tight Upper Bounds
Web and Big DataAbstractCardinality estimation is a critical component of query optimization. Despite extensive research, achieving efficient and accurate estimation for join queries remains challenging. Estimating tight upper bounds for join cardinalities can help the ...
Upper Bounds on the Size of Obstructions and Intertwines
We give an exponential upper bound inp4on the size of any obstruction for path-width at mostp. We give a doubly exponential upper bound ink5 on the size of any obstruction for tree-width at mostk. We also give an upper bound on the size of any ...
Comments
Information & Contributors
Information
Published In
May 2018
1874 pages
ISBN:9781450347037
DOI:10.1145/3183713
- General Chairs:
- Gautam Das,
- Christopher Jermaine,
- Philip Bernstein
Copyright © 2018 Owner/Author.
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 27 May 2018
Check for updates
Qualifiers
- Abstract
Funding Sources
Conference
SIGMOD/PODS '18
Sponsor:
Acceptance Rates
SIGMOD '18 Paper Acceptance Rate 90 of 461 submissions, 20%;
Overall Acceptance Rate 785 of 4,003 submissions, 20%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 300Total Downloads
- Downloads (Last 12 months)36
- Downloads (Last 6 weeks)5
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in