DBScholar

Back to papers

On the Recognition and Design of Acyclic Databases

Summary: Characterize a schema's acyclicity degree via a 'pruning predicate' — a leaf-like property holding for a nonempty set of relation schemes that can be recursively eliminated. Yields a pruning algorithm to compute acyclicity degree and incremental design rules to preserve it. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
hae8442e92cf78c17
Venue
PODS
Year
1984
Pagerank
6.0355739e-05
Overall Rank
5,691 | 61.74%
DOI
10.1145/588011.588013

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{datri_pods84,
        address = {New York, NY, USA},
        series = {{PODS} '84},
        title = {{On the Recognition and Design of Acyclic Databases}},
        url = {https://dl.acm.org/doi/10.1145/588011.588013},
        doi = {10.1145/588011.588013},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {D'Atri, A. and Moscarini, M.},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
13,483 On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract) 1986 PODS 4.9793485e-05
13,486 Alpha-Acyclic Decompositions of Relational Database Schemes 1986 PODS 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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