Database Paper Browser

Back to papers

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)

Paper ID
5382
Venue
SIGMOD
Year
2017
Pagerank
4.1905499e-05
Overall Rank
11,793 | 18.04%
DOI
10.1145/3035918.3058748

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,179 A Hierarchical Contraction Scheme for Querying Big Graphs 2022 SIGMOD 4.803776e-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,117 PIQL: A Performance Insightful Query Language 2010 SIGMOD 6.4319226e-05
4,545 Bounded Conjunctive Queries 2014 VLDB 6.0917464e-05
7,061 Querying Big Data by Accessing Small Data 2015 PODS 4.8400281e-05
7,410 On Scale Independence for Querying Big Data 2014 PODS 4.7320027e-05
8,963 An Effective Syntax for Bounded Relational Queries 2016 SIGMOD 4.4165156e-05
11,834 Bounded Query Rewriting Using Views 2016 PODS 4.1905499e-05
Previous Page 1 / 1 Next

Semantically Similar Papers