Querying Big Data by Accessing Small Data

Summary: Define bounded evaluability: under index/cardinality access constraints, Q can be answered by inspecting a D_Q whose size and discovery cost depend only on Q and the constraints. Show FO undecidable in general, identify decidable FO fragments with effective syntax, and develop two approximation methods (bounded envelopes, parameter specialization) with decision/complexity results. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1656
Venue: PODS
Year: 2015
Pagerank: 4.8400281e-05
Overall Rank: 7,061 | 50.93%
DOI: 10.1145/2745754.2745771

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,161	VerdictDB: Universalizing Approximate Query Processing	2018	SIGMOD	0.00013579831
1,574	Approximate Query Processing: No Silver Bullet	2017	SIGMOD	0.00011289028
2,589	Database Learning: Toward a Database that Becomes Smarter Every Time	2017	SIGMOD	8.4868591e-05
7,179	A Hierarchical Contraction Scheme for Querying Big Graphs	2022	SIGMOD	4.803776e-05
8,712	Data Driven Approximation with Bounded Resources	2017	VLDB	4.4578168e-05
8,963	An Effective Syntax for Bounded Relational Queries	2016	SIGMOD	4.4165156e-05
11,677	Block as a Value for SQL over NoSQL	2019	VLDB	4.1905499e-05
11,793	BEAS: Bounded Evaluation of SQL Queries	2017	SIGMOD	4.1905499e-05
11,834	Bounded Query Rewriting Using Views	2016	PODS	4.1905499e-05
11,839	Logical Aspects of Massively Parallel and Distributed Systems	2016	PODS	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
275	Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets	1999	SIGMOD	0.00029381206
360	Histogram-Based Approximation of Set-Valued Query Answers	1999	VLDB	0.00025768448
1,257	Dynamic Sample Selection for Approximate Query Processing	2003	SIGMOD	0.00013002384
1,400	Wavelet Synopses with Error Guarantees	2002	SIGMOD	0.0001219602
1,419	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00012072488
1,706	SCADS: Scale-Independent Storage for Social Computing Applications	2009	CIDR	0.00010806188
1,867	Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems	2014	SIGMOD	0.00010264932
2,062	PIQL: Success-Tolerant Query Processing in the Cloud	2012	VLDB	9.654149e-05
3,069	Processing First-Order Queries under Limited Access Patterns	2004	PODS	7.6161135e-05
4,055	On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates	1998	PODS	6.4906839e-05
4,545	Bounded Conjunctive Queries	2014	VLDB	6.0917464e-05
7,410	On Scale Independence for Querying Big Data	2014	PODS	4.7320027e-05
8,850	Efficient Approximations of Conjunctive Queries	2012	PODS	4.4324268e-05
12,105	Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory)	2013	VLDB	4.1905499e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,843	Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints	2025	PODS	4.2680295e-05
3,782	Bag Query Containment and Information Theory	2020	PODS	6.7691169e-05
4,207	Querying Big Graphs within Bounded Resources	2014	SIGMOD	6.3519481e-05
11,834	Bounded Query Rewriting Using Views	2016	PODS	4.1905499e-05
8,850	Efficient Approximations of Conjunctive Queries	2012	PODS	4.4324268e-05
867	Query Optimization in the Presence of Limited Access Patterns	1999	SIGMOD	0.00015757737
7,410	On Scale Independence for Querying Big Data	2014	PODS	4.7320027e-05
3,069	Processing First-Order Queries under Limited Access Patterns	2004	PODS	7.6161135e-05
8,963	An Effective Syntax for Bounded Relational Queries	2016	SIGMOD	4.4165156e-05
4,545	Bounded Conjunctive Queries	2014	VLDB	6.0917464e-05