Database Paper Browser

Back to papers

Alpha-Acyclic Decompositions of Relational Database Schemes

Summary: Investigates decomposing a relation into an alpha-acyclic, lossless BCNF schema via the standard decomposition and exhibits a universal relation that admits no such lossless alpha-acyclic BCNF decomposition. Characterizes decomposition processes that yield alpha-acyclic schemes. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
771
Venue
PODS
Year
1986
Pagerank
4.1945683e-05
Overall Rank
12,998 | 9.58%
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 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
4,025 On the Recognition and Design of Acyclic Databases 1984 PODS 6.5212056e-05
Previous Page 1 / 1 Next

Semantically Similar Papers