The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Allocating Storage for Extendible Arrays
Journal of the ACM (JACM)
Dynamic multipaging in even less space
ACM SIGMOD Record
External Hashing Schemes for Collections of Data Structures
Journal of the ACM (JACM)
Sharing Extendible Arrays in a Distributed Environment
IICS '01 Proceedings of the International Workshop on Innovative Internet Computing Systems
An extendible multidimensional array system for MOLAP
Proceedings of the 2006 ACM symposium on Applied computing
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories
IEEE Transactions on Parallel and Distributed Systems
Virtual hashing: a dynamically changing hashing
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Linear hashing: a new tool for file and table addressing
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
An incremental maintenance scheme of data cubes
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Cache-Conscious collision resolution in string hash tables
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Chunked extendible dense arrays for scientific data storage
Parallel Computing
| Hi-index | 0.00 |
The use of hashing schemes for storing extendible arrays is investigated. It is shown that extendible hashing schemes whose worst-case access behavior is close to optimal must utilize storage inefficiently; conversely hashing schemes that utilize storage too conservatively are inevitably poor in expected access time. If requirements for the utilization of storage are relaxed slightly, then one can find rather efficient extendible hashing schemes. Specifically, for any dimensionality of arrays, one can find extendible hashing schemes which at once utilize storage well (fewer than 2p storage locations need be set aside for storing arrays having p or fewer positions) and enjoy good access characteristics (expected access time is O(1), and worst-case access time is O(log log p) for p- or fewer-position arrays). Moreover, at the cost of only a modest additive increase in access time, storage demands can be decreased to (1 + &dgr;)p locations for arbitrary &dgr; 0.