GYO reductions, canonical connections, tree and cyclic schemas and tree projections

Authors:
Nathan Goodman;Oded Shmueli;Y. C. Tay
Affiliations:
Harvard University;Harvard University;Harvard University
Venue:
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Year:
1983

Citing 11
Cited 4

A simplied universal relation assumption and its properties

ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries

ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases

ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries

Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Syntactic Characterization of Tree Database Schemas

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Connections in acyclic hypergraphs: extended abstract

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The tree property is fundamental for query processing

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Transforming cyclic schemas into trees

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Properties of acyclic database schemes

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

On the recognition and design of acyclic databases

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
On the cyclic to acyclic scheme transformation and solving cyclic queries

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Maintenance of views

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Comparative Study of Various Nested Normal Forms

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Database schemas may be partitioned into two sub-classes tree schemas and cyclic schemas. The analysis of tree vs cyclic schemas introduced the concepts of GYO reductions, canonical connections and tree projections. This paper investigates the intricate relationships among these concepts in the context of universal relation databases.