Database Paper Browser

Back to papers

Capturing Missing Tuples and Missing Values

Summary: Introduce c-instances—conditional tables constrained by master data—to model partially closed databases with both missing tuples and missing values, and define three semantics for query completeness under different value-instantiation regimes. Study four problems (completeness checking, existence, minimal-size completeness, bounded-size existence) and establish matching upper and lower complexity bounds across several query languages for each completeness model. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1517
Venue
PODS
Year
2010
Pagerank
5.4957751e-05
Overall Rank
5,459 | 62.03%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,273 Identifying the Extent of Completeness of Query Answers over Partially Complete Databases 2015 SIGMOD 5.1323078e-05
7,560 Complete Approximations of Incomplete Queries 2013 VLDB 4.7102455e-05
12,209 Completeness of Queries over Incomplete Databases 2011 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers