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

DOI10.1016/0022-0000(84)90004-7zbMath0552.68083OpenAlexW1979788646MaRDI QIDQ801698

Y. C. Tay, Oded Shmueli, Nathan Goodman

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(84)90004-7

zbMATH Keywords

relational databasecyclic schemasDatabase schemastree schemas

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items

Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments ⋮ A fast algorithm for query optimization in universal-relation databases ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Connections in acyclic hypergraphs
• Acyclic join dependency and data base projections
• The tree projection theorem and relational query processing
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Syntactic Characterization of Tree Database Schemas
• On Determining Tree Query Membership Of A Distributed Query
• Using Semi-Joins to Solve Relational Queries
• Power of Natural Semijoins
• A simplied universal relation assumption and its properties
• Tree queries
• Equivalences among Relational Expressions