By Topic

Performance of a composite attribute and join index

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

1 Author(s)
Desai, B.C. ; Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada

The use of a composite index known as the Bc-tree is presented; it is based on the concept of the B+-tree and serves the dual purpose of an attribute and join index and indirectly implements the link sets. The leaf node of the Bc-tree incorporates in each leaf node a reference to all tuples in the database that share common data values of a shared domain. In addition to improving the performance of the join and selection operations, the composite index facilitate the enforcement of structural integrity constraints. The author also presents the results of simulations that compare the performance of this approach with the simple join technique. The proposed approach, in the case of the simulated database, is seen to provide better performance for an average domain value size of greater than between 2 and 4 bytes

Published in:

Software Engineering, IEEE Transactions on  (Volume:15 ,  Issue: 2 )