DBScholar

Back to papers

Transforming Cyclic Schemas Into Trees (Extended Abstract)

Summary: Methods to convert cyclic relational schemas (modeled as hypergraphs) into acyclic tree schemas; characterizes tree schemas and several cyclic-to-tree (CTT) transformation modes. Uses CTTs to expose hypergraph structure, improve design properties, and enable query-processing that treats a schema as acyclic relative to a query, with sketches of the corresponding query actions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
608
Venue
PODS
Year
1982
Pagerank
6.3489846e-05
Overall Rank
5,140 | 64.74%
DOI
10.1145/588111.588120

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{goodman_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{TRANSFORMING CYCLIC SCHEMAS INTO TREES (EXTENDED ABSTRACT)}},
        url = {https://dl.acm.org/doi/10.1145/588111.588120},
        doi = {10.1145/588111.588120},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Goodman, N. and Shmueli, O.},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers