Database Paper Browser

Back to papers

On The Recognition Of Coverings Of Acyclic Database Hypergraphs

Summary: Model schemas as hypergraphs with directed hyperedges encoding join and functional dependencies; define a database-hypergraph closure and relate it to JDs, FDs, tableaux and the chase. Prove equivalence: hypergraph admits an acyclic schema iff its closure is acyclic, and give algorithms showing recognition is polynomial-time in most cases. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
666
Venue
PODS
Year
1983
Pagerank
4.9348368e-05
Overall Rank
6,761 | 52.97%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
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
6,603 Properties Of Database Schemata With Functional Dependencies 1984 PODS 4.9971153e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 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
Previous Page 1 / 1 Next

Semantically Similar Papers