The INCINERATE data model

In this article, we present an extended relational algebra with universally or existentially quantified classes as attribute values. The proposed extension can greatly enhance the expressive power of relational systems, and significantly reduce the size of a database, at small additional computational cost. We also show how the proposed extensions can be built on top of a standard relational database system.

[1]  David W. Etherington.  Formalizing Non-Monotonic Reasoning Systems , 1983 .

[2]  Richard R. Muntz,et al.  Implicit Representation for Extensional Answers , 1988, Expert Database Conf..

[3]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[4]  Tomasz Imielinski,et al.  Intelligent Query Answering in Rule Based Systems , 1988, J. Log. Program..

[5]  Alexander Borgida,et al.  Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.

[6]  Raymond Reiter,et al.  A sound and sometimes complete query evaluation algorithm for relational databases with null values , 1986, JACM.

[7]  Carlo Zaniolo,et al.  Database relations with null values , 1982, J. Comput. Syst. Sci..

[8]  David S. Touretzky,et al.  The Mathematics of Inheritance Systems , 1984 .

[9]  H. V. Jagadish,et al.  A compression technique to materialize transitive closure , 1990, TODS.

[10]  Ronald J. Brachman,et al.  An overview of the KL-ONE Knowledge Representation System , 1985 .

[11]  David Robson,et al.  Smalltalk-80: The Language and Its Implementation , 1983 .

[12]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[13]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[14]  David W. Etherington.  Formalizing Nonmonotonic Reasoning Systems , 1987, Artif. Intell..

[15]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[16]  Patrick Lincoln,et al.  Efficient implementation of lattice operations , 1989, TOPL.

[17]  Tomasz Imeilinski.  Intelligent query answering in rule based systems , 1987 .

[18]  Hassan Aït-Kaci,et al.  LOGIN: A Logic Programming Language with Built-In Inheritance , 1986, J. Log. Program..

[19]  H. V. Jagadish.  Incorporating hierarchy in a relational model of data , 1989, SIGMOD '89.

[20]  Alexander Borgida,et al.  Language features for flexible handling of exceptions in information systems , 1985, TODS.

[21]  Georg Gottlob,et al.  Closed World Databases Opened Through Null Values , 1988, VLDB.

[22]  Roger King,et al.  Semantic database modeling: survey, applications, and research issues , 1987, CSUR.

[23]  Alexander Borgida,et al.  Modeling class hierarchies with contradictions , 1988, SIGMOD '88.

[24]  Joachim Biskup,et al.  A foundation of CODD's relational maybe-operations , 1983, TODS.

[25]  Amihai Motro,et al.  Integrity = validity + completeness , 1989, TODS.

[26]  Amihai Motro.  Using Integrity Constraints to Provide Intensional Answers to Relational Queries , 1989, VLDB.

[27]  Michael Kifer,et al.  F-logic: a higher-order language for reasoning about objects, inheritance, and scheme , 1989, SIGMOD '89.