By Topic

On parallel retrievals using distributed memory computers

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
$33 $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)
D. Motzkin ; Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA ; A. K. Gupta

The authors introduce an efficient indexing organization which provides for parallel retrievals. Given a p-processor massively parallel computer, the organization allows a maximum of p retrievals to be performed concurrently and thus achieves an approximate speed up of p in the best case. The index structure is based on the multi-B-tree index structure. It is compatible with current automatic retrieval and query processing techniques. It is also compatible with a variety of file organizations. In addition to an indexed attribute which the authors refer to as primary attribute, a secondary attribute can be included in the index as no additional cost. Updates are achieved with a high degree of efficiency as well. The parallel organization of a multi-B-tree index improves considerably the performance of the index. The method discussed here can be easily applied to standard B+ tree, B* tree and other B tree variations

Published in:

Advances in Parallel and Distributed Systems, 1993., Proceedings of the IEEE Workshop on

Date of Conference:

6 Oct 1993