DBScholar

Back to papers

The Tree Property Is Fundamental For Query Processing (Extended Abstract)

Summary: Partition schemas into tree vs cyclic; prove that computing full-join projections using join/project/semijoin is equivalent to constructing an embedded tree schema (a tree projection). Use tree projections to characterize solvability and bound the number of joins required. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
607
Venue
PODS
Year
1982
Pagerank
9.1638984e-05
Overall Rank
2,102 | 85.58%
DOI
10.1145/588111.588119

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{goodman_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{THE TREE PROPERTY IS FUNDAMENTAL FOR QUERY PROCESSING (EXTENDED ABSTRACT)}},
        url = {https://dl.acm.org/doi/10.1145/588111.588119},
        doi = {10.1145/588111.588119},
        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 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
40 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00046918506
Previous Page 1 / 1 Next

Semantically Similar Papers