ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Making Object-Oriented Schemas More Expressive.

Diego Calvanese, Maurizio Lenzerini: Making Object-Oriented Schemas More Expressive. PODS 1994: 243-254
@inproceedings{DBLP:conf/pods/CalvaneseL94,
  author    = {Diego Calvanese and
               Maurizio Lenzerini},
  title     = {Making Object-Oriented Schemas More Expressive},
  booktitle = {Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium
               on Principles of Database Systems, May 24-26, 1994, Minneapolis,
               Minnesota},
  publisher = {ACM Press},
  year      = {1994},
  isbn      = {0-89791-642-5},
  pages     = {243-254},
  ee        = {http://doi.acm.org/10.1145/182591.182620, db/conf/pods/pods94-243.html},
  crossref  = {DBLP:conf/pods/94},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

Current object-oriented data models lack several important features that would allow one to express relevant knowledge about the classes of a schema. Inparticular, there is no data model supporting simultaneously the inverse of the functions represented by attributes, the union, the intersection and the complement of classes, the possibility of using nonbinary relations, and the possibility of expressing cardinality constraints on attributes and relations. In this paper we define a new data model, called CAR, which extends the basic core of current object-oriented data models with all the above mentioned features. A technique is then presented both for checking the consistency of class definitions, and for computing the logical consequences of the knowledge represented in the schema. Finally, the inherent complexity of reasoning in CAR is investigated, and the complexity of our inferencing technique is studied, depending on various assumptions on the schema.

Copyright © 1994 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.

Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ... BibTeX

Printed Edition

Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota. ACM Press 1994, ISBN 0-89791-642-5
Contents BibTeX

Online Edition: ACM Digital Library

[Abstract and Index Terms]
[Full Text in PDF Format, 1271 KB]

References

[AGO91]
Antonio Albano, Giorgio Ghelli, Renzo Orsini: A Relationship Mechanism for a Strongly Typed Object-Oriented Database Programming Language. VLDB 1991: 565-575 BibTeX
[AK89]
Serge Abiteboul, Paris C. Kanellakis: Object Identity as a Query Language Primitive. SIGMOD Conference 1989: 159-173 BibTeX
[AP86]
Paolo Atzeni, Douglas Stott Parker Jr.: Formal Properties of Net-Based Knowledge Representation Schemes. ICDE 1986: 700-706 BibTeX
[BCN92]
...
[BDS93]
...
[CK86]
...
[CL94]
Diego Calvanese, Maurizio Lenzerini: On the Interaction Between ISA and Cardinality Constraints. ICDE 1994: 204-213 BibTeX
[Dal92]
...
[DL93]
Giuseppe Di Battista, Maurizio Lenzerini: Deductive Entity-Relationship Modeling. IEEE Trans. Knowl. Data Eng. 5(3): 439-450(1993) BibTeX
[DLNN91]
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt: The Complexity of Concept Languages. KR 1991: 151-162 BibTeX
[FK85]
Richard Fikes, Tom Kehler: The Role of Frame-Based Representation in Reasoning. Commun. ACM 28(9): 904-920(1985) BibTeX
[GJ79]
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX
[GM84]
...
[Kim90]
...
[LN90]
Maurizio Lenzerini, Paolo Nobili: On the satisfiability of dependency constraints in entity-relationship schemata. Inf. Syst. 15(4): 453-461(1990) BibTeX
[LR89]
Christophe Lécluse, Philippe Richard: Modeling Complex Structures in Object-Oriented Databases. PODS 1989: 360-368 BibTeX
[LS83]
Maurizio Lenzerini, Gaetano Santucci: Cardinality Constraints in the Entity-Relationship Model. ER 1983: 529-549 BibTeX
[LV87]
Peter Lyngbæk, Victor Vianu: Mapping a Semantic Database Model to the Relational Model. SIGMOD Conference 1987: 132-142 BibTeX
[Neb88]
Bernhard Nebel: Computational Complexity of Terminological Reasoning in BACK. Artif. Intell. 34(3): 371-383(1988) BibTeX
[Pap81]
Christos H. Papadimitriou: On the complexity of integer programming. J. ACM 28(4): 765-768(1981) BibTeX
[Tha92]
Bernhard Thalheim: Fundamentals of Cardinality Constraints. ER 1992: 7-23 BibTeX

Referenced by

  1. Domenico Beneventano, Sonia Bergamaschi, Stefano Lodi, Claudio Sartori: Consistency Checking in Complex Object Database Schemata with Integrity Constraints. IEEE Trans. Knowl. Data Eng. 10(4): 576-598(1998)
  2. Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini: Datalog and Description Logics: Expressive Power. DBPL 1997: 281-298
  3. Dimitri Theodoratos: Deductive Object Oriented Schemas. ER 1996: 58-72
  4. Jan Hidders: Union-Types in Object-Oriented Schemes. DBPL 1995: 2
  5. Domenico Beneventano, Sonia Bergamaschi, Stefano Lodi, Claudio Sartori: Consistency Checking in Complex Object Database Schemata with Integrity Constraints. DBPL 1995: 4
  6. Thomas Lukasiewicz, Werner Kießling, Gerhard Köstler, Ulrich Güntzer: Taxonomic and Uncertain Integrity Constraints in Object-Oriented Databases - the TOP Approach. CIKM 1995: 241-249
  7. Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
    Contents
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:34:11 2009