By Topic

Tree query optimization in distributed object-oriented databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hyeokman Kim ; Dept. of Comput. Eng., Seoul Nat. Univ., South Korea ; Sukho Lee

Much of the work in query optimization in object-oriented database is devoted to finding efficient ways of path traversals expressed in a query. In the environment where a query involves classes distributed across several sites, communication cost must be taken into consideration. In this paper we describe a tree query optimization algorithm using dynamic programming technique for a distributed object-oriented database. The primary objective of the optimization is to minimize the total processing time including local processing and communication costs. In contrast to optimizers which consider a restricted search space, the proposed optimizer searches the execution plans which may be deep or bushy trees. Especially the plans can start traversal anywhere in a query graph and not only from either end of the query graph

Published in:

EUROMICRO 94. System Architecture and Integration. Proceedings of the 20th EUROMICRO Conference.

Date of Conference:

5-8 Sep 1994