Distributed file organization with scalable cost/performance
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
IEEE Transactions on Parallel and Distributed Systems
Location management methods of migratory data resources in ATM networks
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Query processing and inverted indices in shared: nothing text document information retrieval systems
The VLDB Journal — The International Journal on Very Large Data Bases - Parallelism in database systems
A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments
IEEE Transactions on Knowledge and Data Engineering
Self-tuning management of update-intensive multidimensional data in clusters of workstations
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
In this paper we present a method for distributing search structures which have an index, in shared memory multiprocessor multi-disk systems. We show that in comparison with currently used distribution methods, the new method generates distributed search structures having a much lower main memory space requirements, a similar parallel execution capabilities, a similar execution cost per operation, and a fairly close disk space utilization.Analyzing the disk space utilization of the resulting distributed structures is non-trivial. We briefly explain how we have performed such an analysis (which is partially based on a technique called fringe analysis). The result is that the benefits of the method are obtained at a very small cost in terms of reduced disk space utilization.