Database Paper Browser

Back to papers

Incomplete Information and Dependencies in Relational Databases

Summary: Incomplete-information relational databases mix null-valued data with dependencies; chase converts dependencies into a null-based form. With arbitrary implicational dependencies, the transformation is not fully equivalent, and info corruption evades detection under projection, positive selection, union, join, and renaming; also studies view-dependency effects. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2221
Venue
SIGMOD
Year
1983
Pagerank
6.9759696e-05
Overall Rank
3,559 | 75.25%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
2,197 Update Semantics for Incomplete Databases 1985 VLDB 9.3085358e-05
2,347 Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases 1989 PODS 8.9890664e-05
3,496 Dependency Satisfaction in Databases with Incomplete Information 1984 VLDB 7.0397186e-05
4,759 On Relational Algebra With Marked Nulls 1984 PODS 5.9416104e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
13,049 Inverting Relational Expressions - A Uniform And Natural Technique For Various Database Problems 1983 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers