Database Paper Browser

Back to papers

Assumptions in Relational Database Theory

Summary: Critiques standard relational-theory assumptions (universal relation, lossless join, FD inference, decomposition, acyclic JDs), showing they can be stronger or inappropriate for real-world schemas. Gives counterexamples (e.g., FD transitivity can fail) and urges re-evaluation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
603
Venue
PODS
Year
1982
Pagerank
0.00014366096
Overall Rank
1,062 | 92.62%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
135 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00042421957
920 The U. R. Strikes Back 1982 PODS 0.00015338004
1,224 A Generalized Access Path Model And Its Application To A Relational Data Base System 1976 SIGMOD 0.00013194206
1,884 Normal forms and relational database operators 1979 SIGMOD 0.00010215563
Previous Page 1 / 1 Next

Semantically Similar Papers