Data Driven Approximation with Bounded Resources

Summary: BEAS is a resource-bounded query system; with alpha in (0,1], it returns exact Q(D) if feasible or bounded approximations using at most alpha|D| data. Contributes access schema, accuracy metric, and bounded-resource algorithms with deterministic guarantees. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11591
Venue: VLDB
Year: 2017
Pagerank: 4.4578168e-05
Overall Rank: 8,712 | 39.46%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Yang Cao
2. Wenfei Fan

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,574	Approximate Query Processing: No Silver Bullet	2017	SIGMOD	0.00011289028
3,944	AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics	2018	SIGMOD	6.6056349e-05
9,621	ShadowAQP: Efficient Approximate Group-by and Join Query via Attribute-oriented Sample Size Allocation and Data Generation	2023	VLDB	4.3125802e-05
11,677	Block as a Value for SQL over NoSQL	2019	VLDB	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
360	Histogram-Based Approximation of Set-Valued Query Answers	1999	VLDB	0.00025768448
416	Approximate Query Processing Using Wavelets	2000	VLDB	0.00023773968
736	Congressional Samples for Approximate Answering of Group-By Queries	2000	SIGMOD	0.00017414831
1,070	Regret-Minimizing Representative Databases	2010	VLDB	0.00014274615
1,257	Dynamic Sample Selection for Approximate Query Processing	2003	SIGMOD	0.00013002384
1,320	Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters	2016	SIGMOD	0.00012606067
1,394	Sketching Streams Through the Net: Distributed Approximate Query Tracking	2005	VLDB	0.00012218557
2,583	Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee	2016	SIGMOD	8.4973431e-05
3,069	Processing First-Order Queries under Limited Access Patterns	2004	PODS	7.6161135e-05
4,545	Bounded Conjunctive Queries	2014	VLDB	6.0917464e-05
6,119	Distributed Graph Simulation: Impossibility and Possibility	2014	VLDB	5.1991813e-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

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,740	Benchmarking Approximate Consistent Query Answering	2021	PODS	4.9401646e-05
7,944	Efficient Uncertainty Tracking for Complex Queries with Attribute-level Bounds	2021	SIGMOD	4.6089395e-05
2,603	DAQ: A New Paradigm for Approximate Query Processing	2015	VLDB	8.4634633e-05
8,963	An Effective Syntax for Bounded Relational Queries	2016	SIGMOD	4.4165156e-05
4,703	Accelerating Approximate Aggregation Queries with Expensive Predicates	2021	VLDB	5.9793615e-05
8,850	Efficient Approximations of Conjunctive Queries	2012	PODS	4.4324268e-05
4,207	Querying Big Graphs within Bounded Resources	2014	SIGMOD	6.3519481e-05
7,061	Querying Big Data by Accessing Small Data	2015	PODS	4.8400281e-05
9,311	On Efficient Approximate Queries over Machine Learning Models	2023	VLDB	4.3535588e-05
11,793	BEAS: Bounded Evaluation of SQL Queries	2017	SIGMOD	4.1905499e-05