GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
From MaRDI portal
Publication:801698
DOI10.1016/0022-0000(84)90004-7zbMATH Open0552.68083OpenAlexW1979788646MaRDI QIDQ801698FDOQ801698
Authors: Nathan Goodman, Oded Shmueli, Y. C. Tay
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the Desirability of Acyclic Database Schemes
- A simplied universal relation assumption and its properties
- Equivalences among Relational Expressions
- Power of Natural Semijoins
- Degrees of acyclicity for hypergraphs and relational database schemes
- Syntactic Characterization of Tree Database Schemas
- Connections in acyclic hypergraphs
- On Determining Tree Query Membership Of A Distributed Query
- Tree queries
- The tree projection theorem and relational query processing
- Using Semi-Joins to Solve Relational Queries
- Title not available (Why is that?)
- Acyclic join dependency and data base projections
Cited In (3)
This page was built for publication: GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801698)