Database Paper Browser

Back to papers

On The Integrity Of Databases With Incomplete Information

Summary: Defines meaningfulness of incomplete databases via existence of a completion satisfying integrity constraints under two notions: open-world (extension) and closed-world (conservative extension). Shows the closed-world case is strictly harder than open-world in both computational complexity and logical axiomatizability, and both are harder than integrity checking for complete-information databases. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
764
Venue
PODS
Year
1986
Pagerank
8.1371926e-05
Overall Rank
2,776 | 80.71%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank Citing Paper Year Venue Pagerank
2,352 Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases 1989 PODS 8.9815852e-05
3,375 OLAP over Imprecise Data with Domain Constraints 2007 VLDB 7.1627514e-05
3,507 Data Exchange and Incomplete Information 2006 PODS 7.0299158e-05
5,466 Capturing Missing Tuples and Missing Values 2010 PODS 5.4904942e-05
5,467 Relative Information Completeness 2009 PODS 5.4904942e-05
6,505 Representing and Querying XML with Incomplete Information 2001 PODS 5.0282726e-05
6,857 When is Naive Evaluation Possible? 2013 PODS 4.9013761e-05
7,391 Incomplete Information and Certain Answers in General Data Models 2011 PODS 4.7383385e-05
9,512 Computing Full Disjunctions 2003 PODS 4.3299485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
555 On the Semantics of Updates in Databases 1983 PODS 0.00020229919
748 Partition Semantics for Relations 1985 PODS 0.00017194862
3,931 On The Complexity And Axiomatizability Of Consistent Database States 1984 PODS 6.6192327e-05
Previous Page 1 / 1 Next

Semantically Similar Papers