DBScholar

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
691
Venue
PODS
Year
1984
Pagerank
5.4347277e-05
Overall Rank
8,395 | 42.41%
DOI
10.1145/588011.588031

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ozsoyoglu_pods84,
        address = {New York, NY, USA},
        series = {{PODS} '84},
        title = {{On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/588011.588031},
        doi = {10.1145/588011.588031},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ozsoyoglu, Z. Meral and Choukhmane, Elarbi},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

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