Database Paper Browser

Back to papers

Partition Semantics For Incomplete Information In Relational Databases

Summary: Partition semantics for incomplete information in relational databases; framework partitioning possible worlds for consistent queries with FDs. Algorithm for query processing in incomplete information with dependencies; Lipski's model is a special case. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2377
Venue
SIGMOD
Year
1988
Pagerank
4.1945683e-05
Overall Rank
12,956 | 9.87%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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
751 Partition Semantics for Relations 1985 PODS 0.0001721247
2,712 Query Processing in Deductive Databases with Incomplete Information 1986 SIGMOD 8.2488274e-05
Previous Page 1 / 1 Next

Semantically Similar Papers