Database Paper Browser

Back to papers

Relative Information Completeness

Summary: Defines "partially closed" databases via containment constraints q(D)⊆p(Dm) w.r.t. master data Dm to formalize relative information completeness and subsume integrity constraints. Gives decision procedures and tight complexity for (i) checking D's completeness for Q and (ii) existence of a relatively complete D, with CQ-specific characterizations. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1481
Venue
PODS
Year
2009
Pagerank
5.4957751e-05
Overall Rank
5,460 | 62.02%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
5,459 Capturing Missing Tuples and Missing Values 2010 PODS 5.4957751e-05
6,273 Identifying the Extent of Completeness of Query Answers over Partially Complete Databases 2015 SIGMOD 5.1323078e-05
7,413 On Scale Independence for Querying Big Data 2014 PODS 4.7358047e-05
7,560 Complete Approximations of Incomplete Queries 2013 VLDB 4.7102455e-05
11,054 Enriching Relations with Additional Attributes for ER 2024 VLDB 4.1945683e-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 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