The partition model: a deductive database model
- 1 March 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 12 (1) , 1-37
- https://doi.org/10.1145/12047.22718
Abstract
We present a new database model in which each attribute is modeled by a family of disjoint subsets of an underlying population of objects. Such a family is called a partitioning, and the set of all partitionings is turned into a lattice by appropriately defining product and sum. A database is seen as a function from a sublattice into the lattice of partitionings. The model combines the following features: (1) syntactic simplicity (essentially that of the relational model), (2) powerful means for the specification of semantic information (in the form of lattice equations), and (3) deductive capability (essentially that of set theory). The relational model of data and the basic constructs of semantic modeling can be embedded into our model in a simple and straightforward manner.Keywords
This publication has 7 references indexed in Scilit:
- The theory of data dependencies — An overviewPublished by Springer Nature ,1984
- Algebraic dependenciesJournal of Computer and System Sciences, 1982
- An operational approach to data basesPublished by Association for Computing Machinery (ACM) ,1982
- General Lattice TheoryPublished by Springer Nature ,1978
- Database abstractionsACM Transactions on Database Systems, 1977
- The entity-relationship model—toward a unified view of dataACM Transactions on Database Systems, 1976
- A relational model of data for large shared data banksCommunications of the ACM, 1970