Files & databases: an introduction
Files & databases: an introduction
Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
VSAM: access method, services and programming techniques
VSAM: access method, services and programming techniques
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Utilization of B-trees with inserts, deletes and modifies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Distributing a B+-tree in a loosely coupled environment
Information Processing Letters
Maintaining bounded disorder files in multiprocessor multi-disk environments
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
An efficient method for distributing search structures
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Principles of Database Systems
Principles of Database Systems
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
| Hi-index | 0.00 |
Consider the problem of maintaining large indices (or secondary memory indices) in a multiprocessor multidisk environment in which each processor has a dedicated secondary memory (one disk or more). The processors either reside in the same site and communicate via shared memory, or reside in different sites and communicate via a local broadcast network. The straightforward method (SFM) for maintaining such an index, which is commonly called declustering, is to partition the index records equally among the processors, each of which maintains its part of the index in a local B/sup tree. In prior work (Inform. Processing Lett., vol. 34, pp. 313-321, May 1990), we have presented another method, called the "totally distributed B/sup tree" (TDB) method, in which all processors together implement a "wide" B/sup tree. 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, called the combined distribution method (CDM), that combines the ideas underlying SFM and TDB. In tightly coupled environments, CDM outperforms both SFM and TDB in almost all practical settings (in many settings by more than 30%). This is shown by an approximate analysis and verified by simulations. Note that CDM's approach can improve performance in database systems that use a RAID (redundant array of inexpensive disks).