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: 11590
Venue: VLDB
Year: 2017
Pagerank: 4.4619052e-05
Overall Rank: 8,715 | 39.38%
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.00011287495
3,944	AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics	2018	SIGMOD	6.6078243e-05
9,621	ShadowAQP: Efficient Approximate Group-by and Join Query via Attribute-oriented Sample Size Allocation and Data Generation	2023	VLDB	4.3167167e-05
11,672	Block as a Value for SQL over NoSQL	2019	VLDB	4.1945683e-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
361	Histogram-Based Approximation of Set-Valued Query Answers	1999	VLDB	0.00025775749
405	Approximate Query Processing Using Wavelets	2000	VLDB	0.00024057494
739	Congressional Samples for Approximate Answering of Group-By Queries	2000	SIGMOD	0.00017401518
1,072	Regret-Minimizing Representative Databases	2010	VLDB	0.00014270817
1,260	Dynamic Sample Selection for Approximate Query Processing	2003	SIGMOD	0.00012993347
1,323	Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters	2016	SIGMOD	0.00012601997
1,392	Sketching Streams Through the Net: Distributed Approximate Query Tracking	2005	VLDB	0.00012229045
2,580	Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee	2016	SIGMOD	8.5058814e-05
3,065	Processing First-Order Queries under Limited Access Patterns	2004	PODS	7.6230903e-05
4,546	Bounded Conjunctive Queries	2014	VLDB	6.0987778e-05
6,146	Distributed Graph Simulation: Impossibility and Possibility	2014	VLDB	5.1857597e-05
7,085	Querying Big Data by Accessing Small Data	2015	PODS	4.8388174e-05
7,413	On Scale Independence for Querying Big Data	2014	PODS	4.7358047e-05
8,961	An Effective Syntax for Bounded Relational Queries	2016	SIGMOD	4.4206115e-05
11,826	Bounded Query Rewriting Using Views	2016	PODS	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,739	Benchmarking Approximate Consistent Query Answering	2021	PODS	4.9449088e-05
7,941	Efficient Uncertainty Tracking for Complex Queries with Attribute-level Bounds	2021	SIGMOD	4.613363e-05
2,616	DAQ: A New Paradigm for Approximate Query Processing	2015	VLDB	8.4471955e-05
8,961	An Effective Syntax for Bounded Relational Queries	2016	SIGMOD	4.4206115e-05
4,712	Accelerating Approximate Aggregation Queries with Expensive Predicates	2021	VLDB	5.9787986e-05
8,851	Efficient Approximations of Conjunctive Queries	2012	PODS	4.4363908e-05
4,211	Querying Big Graphs within Bounded Resources	2014	SIGMOD	6.3563454e-05
7,085	Querying Big Data by Accessing Small Data	2015	PODS	4.8388174e-05
9,351	On Efficient Approximate Queries over Machine Learning Models	2023	VLDB	4.3524472e-05
11,785	BEAS: Bounded Evaluation of SQL Queries	2017	SIGMOD	4.1945683e-05