CLASSIC: A Structural Data Model for Objects.
Alexander Borgida, Ronald J. Brachman, Deborah L. McGuinness, Lori Alperin Resnick:
CLASSIC: A Structural Data Model for Objects.
SIGMOD Conference 1989: 58-67@inproceedings{DBLP:conf/sigmod/BorgidaBMR89,
author = {Alexander Borgida and
Ronald J. Brachman and
Deborah L. McGuinness and
Lori Alperin Resnick},
editor = {James Clifford and
Bruce G. Lindsay and
David Maier},
title = {CLASSIC: A Structural Data Model for Objects},
booktitle = {Proceedings of the 1989 ACM SIGMOD International Conference on
Management of Data, Portland, Oregon, May 31 - June 2, 1989},
publisher = {ACM Press},
year = {1989},
pages = {58-67},
ee = {http://doi.acm.org/10.1145/67544.66932},
crossref = {DBLP:conf/sigmod/89},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
CLASSIC is a data model that encourages the description of objects not only in terms of their relations to other known objects, but in terms of a level of intensional structure as well. The CLASSIC language of structured descriptions permits i) partial descriptions of individuals, under an 'open world' assumption, ii) answers to queries either as extensional lists of values or as descriptions that necessarily hold of all possible answers, and iii) an easily extensible schema, which can be accessed uniformly with the data. One of the strengths of the approach is that the same language plays multiple roles in the processes of defining and populating the DB, as well as querying and answering.
CLASSIC (for which we have a prototype main-memory implementation) can actively discover new information about objects from several sources: it can recognize new classes under which an object falls based on a description of the object, it can propagate some deductive consequences of DB updates, it has simple procedural recognizers, and it supports a limited form of forward-chaining rules to derive new conclusions about known objects.
The kind of language of descriptions and queries presented here provides a new arena for the search for languages that are more expressive than conventional DBMS languages, but for which query processing is still tractable. This space of languages differs from the subsets of predicate calculus hitherto explored by deductive databases.
Copyright © 1989 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.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
James Clifford, Bruce G. Lindsay, David Maier (Eds.):
Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, May 31 - June 2, 1989.
ACM Press 1989
, SIGMOD Record 18(2), June 1989
Contents
References
- [1]
- Serge Abiteboul, Richard Hull:
IFO: A Formal Semantic Database Model.
ACM Trans. Database Syst. 12(4): 525-565(1987)

- [2]
- Rakesh Agrawal, Alexander Borgida, H. V. Jagadish:
Efficient Management of Transitive Relationships in Large Data and Knowledge Bases.
SIGMOD Conference 1989: 253-262

- [3]
- ...
- [4]
- Hassan Aït-Kaci, Roger Nasr:
LOGIN: A Logic Programming Language with Built-In Inheritance.
J. Log. Program. 3(3): 185-215(1986)

- [5]
- T. Lougenia Anderson, Earl F. Ecklund Jr., David Maier:
Proteus: Objectifying the DBMS User Interface.
OODBS 1986: 133-145

- [6]
- François Bancilhon, Raghu Ramakrishnan:
An Amateur's Introduction to Recursive Query Processing Strategies.
SIGMOD Conference 1986: 16-52

- [7]
- Howard W. Beck, Sunit K. Gala, Shamkant B. Navathe:
Classification as a Query Processing Technique in the CANDIDE Semantic Data Model.
ICDE 1989: 572-581

- [8]
- Ronald J. Brachman, Hector J. Levesque:
The Tractability of Subsumption in Frame-Based Description Languages.
AAAI 1984: 34-37

- [9]
- ...
- [10]
- ...
- [11]
- Laurence Cholvy, Robert Demolombe:
Querying a Rule Base.
Expert Database Conf. 1986: 477-485

- [12]
- ...
- [13]
- ...
- [14]
- Hervé Gallaire, Jack Minker, Jean-Marie Nicolas:
Logic and Databases: A Deductive Approach.
ACM Comput. Surv. 16(2): 153-185(1984)

- [15]
- Randy Goebel:
The Design and Implementation of DLOG, a Prolog-based Knowledge Representation System.
New Generation Comput. 3(4): 385-401(1985)

- [16]
- Richard Hull, Roger King:
Semantic Database Modeling: Survey, Applications, and Research Issues.
ACM Comput. Surv. 19(3): 201-260(1987)

- [17]
- ...
- [18]
- Tomasz Imielinski:
Intelligent Query Answering in Rule Based Systems.
J. Log. Program. 4(3): 229-257(1987)

- [19]
- ...
- [20]
- Robert M. MacGregor:
A Deductive Pattern Matcher.
AAAI 1988: 403-408

- [21]
- Leo Mark:
Defining views in the Binary Relationship Model.
Inf. Syst. 12(3): 281-294(1987)

- [22]
- Bernhard Nebel:
Computational Complexity of Terminological Reasoning in BACK.
Artif. Intell. 34(3): 371-383(1988)

- [23]
- ...
- [24]
- ...
- [25]
- ...
- [26]
- Raymond Reiter:
On Closed World Data Bases.
Logic and Data Bases 1977: 55-76

- [27]
- David W. Shipman:
The Functional Data Model and the Data Language DAPLEX.
ACM Trans. Database Syst. 6(1): 140-173(1981)

- [28]
- Chung-Dak Shum, Richard R. Muntz:
Implicit Representation for Extensional Answers.
Expert Database Conf. 1988: 497-522

- [29]
- ...
Last update Tue Sep 18 00:25:03 2012
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page