Database Paper Browser

Back to papers

Elimination of Intersection Anomalies from Database Schemes (Extended Abstract)

Summary: Constructive transformation for schemes with multivalued dependencies that eliminates intersection anomalies by iteratively adding a single attribute and dependencies per anomaly. Proves termination (removes all intersection anomalies) and characterizes removable attributes to obtain an acyclic scheme. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
671
Venue
PODS
Year
1983
Pagerank
7.3938086e-05
Overall Rank
3,198 | 77.76%
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
1,052 A Normal Form for Nested Relations 1985 PODS 0.00014436103
3,047 Comprehensive Approach to the Design of Relational Database Schemes 1984 VLDB 7.6561027e-05
3,090 Database Decomposition Into Fourth Normal Form 1983 VLDB 7.582872e-05
4,025 On the Recognition and Design of Acyclic Databases 1984 PODS 6.5212056e-05
6,180 The Design of non-1NF Relational Databases into Nested Normal Form 1987 SIGMOD 5.1686632e-05
13,028 Dependency Characterizations For Acyclic Database Schemes 1984 PODS 4.1945683e-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
170 A Complete Axiomatization For Functional And Multivalued Dependencies In Database Relations 1977 SIGMOD 0.0003886136
1,358 The Tree Property Is Fundamental For Query Processing (Extended Abstract) 1982 PODS 0.00012387987
2,026 REAL-WORLD MVD's 1981 SIGMOD 9.7457158e-05
Previous Page 1 / 1 Next

Semantically Similar Papers