By Topic

Distributed indices for accessing distributed data

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

3 Author(s)
Johnson, T. ; Florida Univ., Gainesville, FL, USA ; Krishna, P. ; Colbrook, A.

Distributed-search structures are being developed to address the problem of indexing distributed data. The design goal is to create distributed indices that are highly parallel, require low overhead, and can perform data load balancing. These structures can be used to provide highly parallel and scalable indexing on a multiprocessor, and a versatile and low-overhead dynamic index on a distributed system. The first distributed-search structure considered was the dB-tree, a distributed B-tree. It was shown how a highly-parallel but low-overhead dB-tree can be implemented by carefully controlling the degree of replication, and by using lazy updates. A significant use of a distributed index is to aid in load balancing. It was shown experimentally that simple heuristics using out-of-data load information can perform very effective load balancing

Published in:

Mass Storage Systems, 1993. Putting all that Data to Work. Proceedings., Twelfth IEEE Symposium on

Date of Conference:

26-29 Apr 1993