An Effective Syntax for Bounded Relational Queries
Summary: Proposes a bounded-RA syntax using covered RA queries, proving bounded RA ⇔ covered RA and PTIME coverage checks. Gives quadratic-time algorithms to decide coverage and generate bounded plans, optimizes access constraints, and shows real-data speedups with many queries covered. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yang Cao (Beihang University; University of Edinburgh)
- 2. Wenfei Fan (Beihang University; University of Edinburgh)
BibTeX Citation
@inproceedings{cao_sigmod16,
title = {{An Effective Syntax for Bounded Relational Queries}},
author = {Cao, Yang and Fan, Wenfei},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2882942},
url = {https://dl.acm.org/doi/10.1145/2882903.2882942},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,082 | Approximate Query Processing: No Silver Bullet | 2017 | SIGMOD | 0.00012122749 |
| 7,015 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD | 5.6210836e-05 |
| 8,846 | Data Driven Approximation with Bounded Resources | 2017 | VLDB | 5.2649328e-05 |
| 12,167 | Block as a Value for SQL over NoSQL | 2019 | VLDB | 4.9793485e-05 |
| 12,288 | BEAS: Bounded Evaluation of SQL Queries | 2017 | SIGMOD | 4.9793485e-05 |
| 12,324 | Bounded Query Rewriting Using Views | 2016 | PODS | 4.9793485e-05 |
| 12,327 | Logical Aspects of Massively Parallel and Distributed Systems | 2016 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,638 | SCADS: Scale-Independent Storage for Social Computing Applications | 2009 | CIDR | 0.00010012154 |
| 2,008 | PIQL: Success-Tolerant Query Processing in the Cloud | 2012 | VLDB | 9.1988831e-05 |
| 2,790 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS | 8.0100392e-05 |
| 3,000 | Querying with Access Patterns and Integrity Constraints | 2015 | VLDB | 7.7669839e-05 |
| 3,447 | Complete Yet Practical Search for Minimal Query Reformulations Under Constraints | 2014 | SIGMOD | 7.2941472e-05 |
| 4,452 | Bounded Conjunctive Queries | 2014 | VLDB | 6.5938977e-05 |
| 4,464 | On the Correct and Complete Enumeration of the Core Search Space | 2013 | SIGMOD | 6.5877622e-05 |
| 6,409 | Finite Queries do not Have Effective Syntax | 1995 | PODS | 5.7941437e-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 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,264 | EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract) | 1984 | SIGMOD |
| 2 | 3,000 | Querying with Access Patterns and Integrity Constraints | 2015 | VLDB |
| 3 | 10,508 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD |
| 4 | 7,266 | Query Evaluation using Overlapping Views: Completeness and Efficiency | 2006 | SIGMOD |
| 5 | 794 | On the Complexity of Bounded-Variable Queries | 1995 | PODS |
| 6 | 9,169 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 7 | 6,954 | Querying Big Data by Accessing Small Data | 2015 | PODS |
| 8 | 12,324 | Bounded Query Rewriting Using Views | 2016 | PODS |
| 9 | 869 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD |
| 10 | 4,452 | Bounded Conjunctive Queries | 2014 | VLDB |