Abstract: 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.
Index Terms:
distributed databases; resource allocation; software performance evaluation; database theory; data structures; distributed memory systems; software performance; dictionary machines; scalable distributed data balancing technique; utility commands; database applications; concurrent access; online reorganization; distributed database; multicomputer; distributed memory architectures; load balancing
Citation:
T. Duboux, A. Ferreira, "Achieving Good Performance for Dictionary Machines: A Scalable Distributed Data Balancing Technique," pdp, pp.0266, 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), 1996