Database Paper Browser

Back to papers

Identifying the Extent of Completeness of Query Answers over Partially Complete Databases

Summary: Proposes completeness patterns as table-level selections to denote complete parts of databases. Adapts relational algebra to infer query-answer completeness; proves soundness; extends to instance-aware patterns; shows scalable real-data evaluation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5076
Venue
SIGMOD
Year
2015
Pagerank
5.1323078e-05
Overall Rank
6,273 | 56.37%
DOI
10.1145/2723372.2750544

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers