Paper
Incoherence and subsumption for recursive views and queries in object-oriented data models

https://doi.org/10.1016/S0169-023X(96)00020-1Get rights and content

Abstract

Object-oriented data models are being extended with recursion to gain expressive power. This complicates both the incoherence detection problem which has to deal with recursive classes descriptions and the optimization problem which has to deal with recursive queries on complex objects. In this paper, we propose a theoretical framework able to face the above problems. In particular, it is able to validate and automatically classify in a database schema, (recursive) classes, views and queries, organized in an inheritance taxonomy. The framework adopts the odl formalism (an extension of the Description Logics developed in the area of Artificial Intelligence) which is able to express the semantics of complex object data models and to deal with cyclic references at the schema and instance level. It includes subsumption algorithms, which perform automatic placement in a specialization hierarchy of (recursive) views and queries, and incoherence algorithms, which detect incoherent (i.e., always empty) (recursive) classes, views and queries. As different styles of semantics: greatest fixed-point, least fixed-point and descriptive can be adopted to interpret recursive views and queries, first of all we analyze and discuss the choice of one or another of the semantics and, secondly, we give the subsumption and incoherence algorithms for the three different semantics. We show that subsumption computation and incoherence detection appear to be feasible since in almost all practical cases they can be solved in polynomial time algorithms.

References (40)

  • C. Beeri

    Formal models for object-oriented databases

  • J. Minker et al.

    On recursive axiom in deductive databases

    Information Syst.

    (1983)
  • S. Abiteboul et al.

    Objects and views

  • S. Abiteboul et al.

    Col: a logic-based language for complex objects

  • S. Abiteboul et al.

    IFO: A formal semantic database model

    ACM Trans. Database Syst.

    (1987)
  • S. Abiteboul et al.

    Object identity as a query language primitive

  • R. Agrawal

    Alpha: An extension of relational algebra to express a class of recursive queries

    IEEE Trans. Software Eng.

    (July 1988)
  • M. Atkinson

    The object-oriented database system manifesto

  • F. Baader

    Terminological cycles in KL-ONE-based knowledge representation languages

  • J.P. Ballerini et al.

    Automatic building and validation of complex object database schemata

  • G. Di Battista et al.

    Deductive entity relationship modeling

    IEEE Trans. Knowledge Data Eng.

    (June 1993)
  • H.W. Beck et al.

    Classification as a query processing technique in the CANDIDE data model

  • D. Beneventano et al.

    Subsumption for complex object data models

  • S. Bergamaschi et al.

    Acquisition and validation of complex object database schemata supporting multiple inheritance

    Applied Intelligence: The International Journal of Artificial Intelligence, Neural Networks and Complex Problem Solving Technologies

    (1994)
  • S. Bergamaschi et al.

    On taxonomic reasoning in conceptual design

    ACM Trans. Database Syst.

    (September 1992)
  • E. Bertino et al.

    Object-oriented query languages: The notion and the issues

    IEEE Trans. Knowl. Data Eng.

    (June 1992)
  • A. Borgida et al.

    CLASSIC: A structural data model for objects

  • M. Buchheit et al.

    Subsumption between queries to object-oriented database

  • L. Cardelli

    A semantics of multiple inheritance

  • Cited by (0)

    1

    {benevent,sonia}@dsi.unimo.it

    2

    {benevent,sonia}@dsi.unimo.it

    View full text