BEAS: Bounded Evaluation of SQL Queries
Summary: BEAS enables bounded SQL evaluation under an access schema A (cardinality constraints + indices) to compute Q(D) from a fixed DQ with Q(DQ)=Q(D). It derives DQ from A’s constraints and fetches it through indices, demonstrated on telecom CDR analytics vs. commercial DBs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yang Cao (Beihang University; University of Edinburgh)
- 2. Wenfei Fan (Beihang University; University of Edinburgh)
- 3. Yanghao Wang (University of Edinburgh)
- 4. Tengfei Yuan (University of Edinburgh)
- 5. Yanchao Li (Nanjing University)
- 6. Laura Yu Chen (Huawei)
BibTeX Citation
@inproceedings{cao_sigmod17,
title = {{BEAS: Bounded Evaluation of SQL Queries}},
author = {Cao, Yang and Fan, Wenfei and Wang, Yanghao and Yuan, Tengfei and Li, Yanchao and Chen, Laura Yu},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3035918.3058748},
url = {https://dl.acm.org/doi/10.1145/3035918.3058748},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,015 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD | 5.6210836e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,452 | Bounded Conjunctive Queries | 2014 | VLDB | 6.5938977e-05 |
| 5,870 | PIQL: A Performance Insightful Query Language | 2010 | SIGMOD | 5.9648445e-05 |
| 6,954 | Querying Big Data by Accessing Small Data | 2015 | PODS | 5.6350266e-05 |
| 7,610 | On Scale Independence for Querying Big Data | 2014 | PODS | 5.4844912e-05 |
| 9,152 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD | 5.2177821e-05 |
| 12,324 | Bounded Query Rewriting Using Views | 2016 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,972 | QRelX: Generating Meaningful Queries that Provide Cardinality Assurance | 2010 | SIGMOD |
| 2 | 8,405 | PDQ: Proof-driven Query Answering over Web-based Data | 2014 | VLDB |
| 3 | 4,102 | QED: A Powerful Query Equivalence Decider for SQL | 2024 | VLDB |
| 4 | 5,199 | Exact Cardinality Query Optimization with Bounded Execution Cost | 2019 | SIGMOD |
| 5 | 6,980 | DBease: Making Databases User-friendly and Easily Accessible | 2011 | CIDR |
| 6 | 10,182 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS |
| 7 | 4,452 | Bounded Conjunctive Queries | 2014 | VLDB |
| 8 | 9,152 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD |
| 9 | 6,954 | Querying Big Data by Accessing Small Data | 2015 | PODS |
| 10 | 8,846 | Data Driven Approximation with Bounded Resources | 2017 | VLDB |