Disaggregations in databases

Authors:
Serge Abiteboul
Affiliations:
Univ. of Southern California, Los Angeles
Venue:
Journal of the ACM (JACM)
Year:
1985

Citing 8
Cited 0

Extending the database relational model to capture more meaning

ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies

ACM Transactions on Database Systems (TODS)
Database abstractions: aggregation and generalization

ACM Transactions on Database Systems (TODS)
Properties of functional-dependency families

Journal of the ACM (JACM)
A relational model of data for large shared data banks

Communications of the ACM
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Horn clauses and database dependencies (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Matching functions and disaggregations in databases

Matching functions and disaggregations in databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algebraic foundation of database schema design is presented. A new database operator, namely, disaggregation, is introduced. Beginning with “free” families, repeated applications of disaggregation and three other operators (matching function, Cartesian product, and selection) yield families of increasingly elaborate structure. In particular, families defined by one join dependency and several “embedded” functional dependencies can be obtained in this manner.