Tree Queries: A Simple Class of Relational Queries

@article{Goodman1982TreeQA,
  title={Tree Queries: A Simple Class of Relational Queries},
  author={Nathan Goodman and Oded Shmueli},
  journal={ACM Trans. Database Syst.},
  year={1982},
  volume={7},
  pages={653-677}
}
One can partition the class of relational database schemas into tree schemas and cyclic schemas. (These are called acyclic hypergraphs and cyclic hypergraphs elsewhere in the literature.) This partition has interesting implications in query processing, dependency theory, and graph theory. The tree/cyclic partitioning of database schemas originated with a similar partition of equijoin queries. Given an arbitrary equijoin query one can obtain an equivalent query that calculates the natural join… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…