The Partition Model: A Deductive Database Model.

@article{DBLP:journals/tods/Spyratos87,
  author    = {Nicolas Spyratos},
  title     = {The Partition Model: A Deductive Database Model},
  journal   = {ACM Trans. Database Syst.},
  volume    = {12},
  number    = {1},
  year      = {1987},
  pages     = {1-37},
  ee        = {http://doi.acm.org/10.1145/12047.22718, db/journals/tods/Spyratos87.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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.

Copyright © 1987 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-1 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Peter P. Chen: The Entity-Relationship Model - Toward a Unified View of Data. ACM Trans. Database Syst. 1(1): 9-36(1976) BibTeX

[2]

E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) BibTeX

[3]

...

[4]

...

[5]

...

[6]

John Miles Smith, Diane C. P. Smith: Database Abstractions: Aggregation and Generalization. ACM Trans. Database Syst. 2(2): 105-133(1977) BibTeX

[7]

Nicolas Spyratos: An Operational Approach to Data Bases. PODS 1982: 212-220 BibTeX

[8]

...

[9]

Mihalis Yannakakis, Christos H. Papadimitriou: Algebraic Dependencies. J. Comput. Syst. Sci. 25(1): 2-41(1982) BibTeX

Referenced by

1. Noel Novelli, Rosine Cicchetti: FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies. ICDT 2001: 189-203
2. Stéphane Lopes, Jean-Marc Petit, Lotfi Lakhal: Efficient Discovery of Functional Dependencies and Armstrong Relations. EDBT 2000: 350-364
3. Dominique Laurent, Nicolas Spyratos: A Partition Model Approach to Updating Universal Scheme Interfaces. IEEE Trans. Knowl. Data Eng. 6(2): 316-330(1994)
4. Paolo Atzeni, Riccardo Torlone: Updating Relational Databases Through Weak Instance Interfaces. ACM Trans. Database Syst. 17(4): 718-745(1992)
5. Dimitri Theodoratos: Monadic Databases with Equality. MFDBS 1991: 74-88
6. Paolo Atzeni, Riccardo Torlone: Updating Databases in the Weak Instance Model. PODS 1989: 101-109
7. Paolo Atzeni, Riccardo Torlone: Approaches to Updates over Weak Instances. MFDBS 1989: 12-23
8. Christophe Lécluse, Nicolas Spyratos: Implementing Queries and Updates on Universal Scheme Interfaces. VLDB 1988: 62-75
9. Dominique Laurent, Nicolas Spyratos: Partition Semantics for Incomplete Information in Relational Databases. SIGMOD Conference 1988: 66-73
10. Nicolas Spyratos, Christophe Lécluse: Incorporating Functional Dependencies in Deductive Query Answering. ICDE 1987: 658-664