|Title:||A COMBINED METHOD FOR MAINTAINING INDICES IN MULTIPROCESSER MULTI-DISK ENVIRONMENTS
|Authors:||G. Matsliach and O. Shmue1i
|Abstract:||Consider the problem of maintaining indices in a multiprocessor multi-disk environıment in which each processor has a dedicated disk. The pairs, of disks and processors, either reside in the same site and thus communicate via a shared memory, or resideı in different sites and communicate via a local broadcast network. The straightforward method for maintaining such an index is to partition it equallyı among the processors, each of which maintains its part of the index in a local B+tree. In  we have presented another method in which all processors implementı together a "wide" B+-tree. It was shown by an approximate analysis (13] that thereı are settings in which the second method is better than the first method, and viceı versa.ı In this paper we present a new method which combines the ideas underlying theseı two methods. The combined method outperforms both methods in almost all practiıcal settings (in many settings by more than 30%). This is shown by an approximateı analysis and by extensive simulations.ı|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1990/CS/CS0608), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1990
To the main CS technical reports page
Computer science department, Technion