Database Paper Browser

Back to papers

Inferences Involving Embedded Multivalued Dependencies and Transitive Dependencies

Summary: Demonstrates there is no finite, complete rule set for Embedded Multivalued Dependencies (EMVDs) and Transitive Dependencies (TDs). Explicitly constructs irreducible n-ary EMVD inference rules for all n, via Paredaens' TD framework, illustrating failure of unary/binary rule sets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2119
Venue
SIGMOD
Year
1980
Pagerank
5.2201823e-05
Overall Rank
6,083 | 57.69%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,180 The Design of non-1NF Relational Databases into Nested Normal Form 1987 SIGMOD 5.1686632e-05
6,651 Sort Sets in the Relational Model* (extended abstract) 1983 PODS 4.9763125e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers