Classification as a query processing technique in the CANDIDE semantic data model
Authors:
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 572-581
Abstract
The use of classification and subsumption to process database queries is discussed. The data model, called CANDIDE, is essentially an extended version of the FL-1, KANDOR and BACK, frame-based knowledge representation languages. A novel feature of the approach is that the data-description language and data-manipulation language are identical, thus providing uniform treatment of data objects, query objects and view objects. The classification algorithm find the correct placement for a query object in a given object taxonomy. Tractability issues are explored, and the expressiveness of queries is compared with relational algebra. This data model has been implemented in POPLOG as the basis for a knowledge-base management system that includes an integrated natural-language query system.Keywords
This publication has 12 references indexed in Scilit:
- Computational complexity of terminological reasoning in BACKArtificial Intelligence, 1988
- KID Designing a Knowledge-Based Natural Language InterfaceIEEE Expert, 1987
- A graphical query language supporting recursion1987
- An Algebra for a General Entity-Relationship ModelIEEE Transactions on Software Engineering, 1985
- An Overview of the KL‐ONE Knowledge Representation System*Cognitive Science, 1985
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984
- Making smalltalk a database system1984
- The database language GEM1983
- Database abstractionsACM Transactions on Database Systems, 1977
- An Overview of KRL, a Knowledge Representation LanguageCognitive Science, 1977