Query Processing Utilizing Dependencies And Horizontal Decomposition
Summary: Proposes FD- and MVD-based cyclic-query processing via horizontal decomposition to tree-like plans. FD-based methods unify merging, tuple processing, and attribute addition; horizontal decomposition reveals FDs to simplify joins; MVDs extend framework. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,692 | Weak Multivalued Dependencies+ | 1984 | PODS | 5.3686277e-05 |
| 7,987 | The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) | 1986 | PODS | 4.6089395e-05 |
| 9,284 | Processing Inequality Queries Based On Generalized Semi-Joins | 1984 | VLDB | 4.3595614e-05 |
| 12,948 | Attribute Agreement | 1989 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 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,366 | The Tree Property Is Fundamental For Query Processing (Extended Abstract) | 1982 | PODS | 0.00012375931 |
| 5,036 | Query Processing For Distributed Databases Using Generalized Semi-Joins | 1982 | SIGMOD | 5.7403975e-05 |
Previous
Page 1 / 1
Next