Acyclic join dependency and data base projections
From MaRDI portal
Publication:800103
DOI10.1016/0022-0000(83)90046-6zbMATH Open0549.68092OpenAlexW2001476721MaRDI QIDQ800103FDOQ800103
Authors: Richard Hull 
Publication date: 1983
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(83)90046-6
Recommendations
relational databaseuniversal instancerelation schemejoin dependencyacyclic database schemedatabase decompositionprojections of relations
Cites Work
- Graph theory
- 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
- Connections in acyclic hypergraphs
- Equivalence of Relational Database Schemes
- On Determining Tree Query Membership Of A Distributed Query
- Tree queries
Cited In (11)
- Losslessness and project-join constructibility in relational databases
- A characterization of finite fd-acyclicity
- Join dependencies in relational-database design
- On the complexity of join dependencies
- Joins and solutions of the projection synthesis problem in relational databases. II
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
- The tree projection theorem and relational query processing
- On acyclic database decompositions
- NP-complete problems simplified on tree schemas
- Synthesis of projections in relational data bases
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
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)
