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)
Incoming Non-self Citations Over Time
Authors
- 1. A. D'Atri
- 2. M. Moscarini
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,995 | On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract) | 1986 | PODS | 4.1945683e-05 |
| 12,998 | Alpha-Acyclic Decompositions of Relational Database Schemes | 1986 | PODS | 4.1945683e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,358 | The Tree Property Is Fundamental For Query Processing (Extended Abstract) | 1982 | PODS | 0.00012387987 |
| 3,198 | Elimination of Intersection Anomalies from Database Schemes (Extended Abstract) | 1983 | PODS | 7.3938086e-05 |
| 3,361 | Functional Dependencies on Cyclic Database Schemes | 1983 | SIGMOD | 7.1735665e-05 |
| 4,848 | Transforming Cyclic Schemas Into Trees (Extended Abstract) | 1982 | PODS | 5.8774511e-05 |
| 5,155 | Gyo Reductions, Canonical Connections, Tree And Cyclic Schemas And Tree Projections | 1983 | PODS | 5.660316e-05 |
| 6,761 | On The Recognition Of Coverings Of Acyclic Database Hypergraphs | 1983 | PODS | 4.9348368e-05 |
| 8,216 | Answering Queries In Relational Databases | 1983 | SIGMOD | 4.5575596e-05 |
Previous
Page 1 / 1
Next