By Topic

A join algorithm utilizing multiple path indexes in object-oriented database systems

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

4 Author(s)
Wan-Sup Cho ; Electron. & Telecommun. Res. Inst., Taejeon, South Korea ; Seung-Sun Lee ; Yong-Ik Yoon ; Kyu-Young Whang

Although various types of path indexes-indexes on path expressions-have been proposed for efficient processing of object-oriented queries, conventional join algorithms do not effectively utilize them. We propose a new join algorithm called OID join algorithm that effectively utilizes (multiple) path indexes in object-oriented databases. When (multiple) path indexes are available for a query, the OID join algorithm may reduce the query evaluation cost significantly by taking full advantage of the path indexes. We present a cost analysis for the OID join algorithm and compare it with those of conventional ones

Published in:

Engineering of Complex Computer Systems, 1996. Proceedings., Second IEEE International Conference on

Date of Conference:

21-25 Oct 1996