Database Paper Browser

Back to papers

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)

Paper ID
5133
Venue
SIGMOD
Year
2016
Pagerank
4.4206115e-05
Overall Rank
8,961 | 37.67%
DOI
10.1145/2882903.2882942

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
1,574 Approximate Query Processing: No Silver Bullet 2017 SIGMOD 0.00011287495
6,730 A Hierarchical Contraction Scheme for Querying Big Graphs 2022 SIGMOD 4.9479867e-05
8,715 Data Driven Approximation with Bounded Resources 2017 VLDB 4.4619052e-05
11,672 Block as a Value for SQL over NoSQL 2019 VLDB 4.1945683e-05
11,785 BEAS: Bounded Evaluation of SQL Queries 2017 SIGMOD 4.1945683e-05
11,826 Bounded Query Rewriting Using Views 2016 PODS 4.1945683e-05
11,831 Logical Aspects of Massively Parallel and Distributed Systems 2016 PODS 4.1945683e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers