By Topic

Achieving good performance for dictionary machines; a scalable distributed data balancing technique

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)
T. Duboux ; Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France ; A. Ferreira

We address the problem of how to process utility commands in database applications while the system remains operational and the data remains available for concurrent accesses. In particular, we focus on the online reorganization of a dictionary, a database reduced to its simplest instance, showing its implementation on a multicomputer. As is the case with implementations of dynamic structures on distributed memory architectures, a crucial load balancing problem has to be solved. We propose an elegant solution and prove that it solves this problem. Experimental results are shown and analyzed

Published in:

Parallel and Distributed Processing, 1996. PDP '96. Proceedings of the Fourth Euromicro Workshop on

Date of Conference:

24-26 Jan 1996