Database Paper Browser

Back to papers

Obtaining Complete Answers from Incomplete Databases

Summary: Query answering over incomplete databases; a complete algorithm for answer-completeness via query-update independence. Identifies a polynomial-time case for conjunctions of comparisons; state completeness and extensions to partially-incorrect data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8361
Venue
VLDB
Year
1996
Pagerank
9.0276061e-05
Overall Rank
2,327 | 83.82%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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