Database Paper Browser

Back to papers

Complete Approximations of Incomplete Queries

Summary: System computes complete upper and lower approximations for queries over partially complete databases with table-completeness. Reformulates to guarantee completeness; returns most-specific complete query if exists, otherwise enumerates bounded specializations via fixpoint ASP. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10620
Venue
VLDB
Year
2013
Pagerank
4.7057229e-05
Overall Rank
7,561 | 47.46%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
3,313 Efficient and Effective Data Imputation with Influence Functions 2022 VLDB 7.2336734e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2,331 Obtaining Complete Answers from Incomplete Databases 1996 VLDB 9.019917e-05
5,466 Capturing Missing Tuples and Missing Values 2010 PODS 5.4904942e-05
5,467 Relative Information Completeness 2009 PODS 5.4904942e-05
12,217 Completeness of Queries over Incomplete Databases 2011 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Semantically Similar Papers