Database Paper Browser

Back to papers

On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (Extended Abstract)

Summary: Shows equivalence (on simple schemes) between minimizing joins to make a cyclic schema acyclic and minimizing joins to solve cyclic natural-join queries, proves both NP-complete. Gives a polynomial-time algorithm when the scheme's dual graph is chordal and ties to edge-contraction complexity. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
692
Venue
PODS
Year
1984
Pagerank
4.5783206e-05
Overall Rank
8,134 | 43.42%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,984 The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) 1986 PODS 4.613363e-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