Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Efficient Algorithm for Determining the Optimal Execution Strategy for Path Queries in OODBS
 

Summary: 1
Efficient Algorithm for Determining the Optimal
Execution Strategy for Path Queries in OODBS
Weimin Chen, Karl Aberer
GMD-IPSI, Dolivostr. 15, 64293 Darmstadt, Germany
E-mail: {chen, aberer}@darmstadt.gmd.de
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented da-
tabase system one has to exploit the available index structures on the path. In a database with a
large database schema many alternative strategies have to be considered for the evaluation of a
path query by choosing from a large set of available indices, which can make the selection of the
optimal strategy expensive. We give an algorithm that finds the optimal strategy for evaluating a
path query with time complexity independent of the set of indices available in the database. The
algorithm considersallpossibleforwardandbackwardtraversalstrategiesandhastimecomplexity
O(n2) in the path length n. Incorporating this algorithm into the query optimization for object-ori-
ented database management systems can improve the response time of the system, by optimizing
an equally important and frequent type of queries with high efficiency.
Key Words. Object-oriented databases, Index selection, Query optimization, Paths
1 Introduction
Object-oriented database systems have a strong relationship to programming lan-
guages by means of their data model. Therefore operational aspects play an important

  

Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences