Acyclic join dependency and data base projections
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3648167 (Why is no real title available?)
- A simplied universal relation assumption and its properties
- Connections in acyclic hypergraphs
- Equivalence of Relational Database Schemes
- Equivalences among Relational Expressions
- Graph theory
- On Determining Tree Query Membership Of A Distributed Query
- On the Desirability of Acyclic Database Schemes
- Tree queries
Cited in
(11)- NP-complete problems simplified on tree schemas
- A characterization of finite fd-acyclicity
- Joins and solutions of the projection synthesis problem in relational databases. II
- Synthesis of projections in relational data bases
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
- On the complexity of join dependencies
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
- Join dependencies in relational-database design
- On acyclic database decompositions
- Losslessness and project-join constructibility in relational databases
- The tree projection theorem and relational query processing
This page was built for publication: Acyclic join dependency and data base projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800103)