The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
New file organization based on dynamic hashing
ACM Transactions on Database Systems (TODS)
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Index maintenance for non-uniform record distributions
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Dynamic Hash File for Random and Sequential Accessing
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Associative searching in multiple random access storage units
Associative searching in multiple random access storage units
A compendium of key search references
ACM SIGIR Forum
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The Idea of De-Clustering and its Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
CMD: A Multidimensional Declustering Method for Parallel Data Systems
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
A file maintenance model, called the multiple random access storage units model, is introduced. Storage units can be accessed simultaneously, and the parallel processing of an associative query is achieved by distributing data evenly among the storage units. Maximum parallelism is obtained when data satisfying an associative query are evenly distributed for every possible query. An allocation scheme called M-cycle allocation is proposed to maintain large files of data on multiple random access storage units. The allocation scheme provides an efficient and straightforward indexing over multidimensional key spaces and supports the parallel processing of orthogonal range queries. Our analysis shows that M-cycle allocation achieves the near-optimum parallelism for processing the orthogonal range queries. Moreover, there is no duplication of records and no increase in insertion/deletion cost.