On characterizing boundedness of database schemes with bounded dependencies
From MaRDI portal
Publication:1199825
DOI10.1016/0304-3975(92)90308-3zbMath0754.68044OpenAlexW2040911760WikidataQ114683721 ScholiaQ114683721MaRDI QIDQ1199825
Publication date: 17 January 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90308-3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent database schemas
- On generating database schemes bounded or constant-time-maintainable by extensibility
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Testing unboundedness of database schemes and functional dependencies
- Algebraic dependencies
- Database states and their tableaux
- Formal Systems for Tuple and Equality Generating Dependencies
- On the foundations of the universal relation model
- Some Results on the Representative Instance in Relational Databases
- A Proof Procedure for Data Dependencies
- On Bounded Database Schemes and Bounded Horn-Clause Programs
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Preserving Functional Dependencies
- Equivalence of Relational Database Schemes
- Testing satisfaction of functional dependencies
- Horn clauses and database dependencies
- Functions in databases
- Equivalences among Relational Expressions
- Independence-reducible database schemes
- A characterization of globally consistent databases and their correct access paths
- A relational model of data for large shared data banks
