Affordable Access

Publisher Website

Subsumption between queries to object-oriented databases

Authors
Journal
Information Systems
0306-4379
Publisher
Elsevier
Publication Date
Volume
19
Issue
1
Identifiers
DOI: 10.1016/0306-4379(94)90025-6
Disciplines
  • Computer Science
  • Linguistics
  • Mathematics

Abstract

Abstract Most work on query optimization in relational and object-oriented databases has concentrated on tuning algebraic expressions and the physical access to the database contents. The attention to semantic query optimization, however, has been restricted due to its inherent complexity. We take a second look at semantic query optimization in object-oriented databases and find that reasoning techniques for concept languages developed in Artificial Intelligence apply to this problem because concept languages have been tailored for efficiency and their semantics is compatible with class and query definitions in object-oriented databases. We propose a query optimizer that recognizes subset relationships between a query and a view (a simpler query whose answer is stored) in polynomial time. The selected schema and query language is maximal in the sense that any added feature ruins tractability.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Incoherence and subsumption for recursive views an...

on Data & Knowledge Engineering Jan 01, 1997

Operations and queries in object-oriented database...

on Information and Software Techn... Jan 01, 1993

Two-dimensional specification of queries in object...

on Microprocessing and Microprogr... Jan 01, 1995
More articles like this..