The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Distribution-dependent hashing functions and their characteristics
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Data Types and Structures
Computer Database Organization, 2nd Ed
Computer Database Organization, 2nd Ed
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The Reconstruction and Optimization of Trie Hashing Functions
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
A Dynamic Hash File for Random and Sequential Accessing
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Order-preserving dynamic file organizations for non-uniform access patterns
Order-preserving dynamic file organizations for non-uniform access patterns
Order preserving minimal perfect hash functions and information retrieval
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
A compendium of key search references
ACM SIGIR Forum
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Parallel main memory database system
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
A Parallel Distributive Join Algorithm for Cube-Connected Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing
IEEE Transactions on Knowledge and Data Engineering
B-tree indexes, interpolation search, and skew
DaMoN '06 Proceedings of the 2nd international workshop on Data management on new hardware
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Availability of multi-object operations
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
A correlation-aware data placement strategy for key-value stores
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Augmented order preserving minimal perfect hash functions for very large digital libraries
CIT'11 Proceedings of the 5th WSEAS international conference on Communications and information technology
| Hi-index | 0.00 |
File organizations based on conventional hash functions provide faster access to the stored records in comparison with tree-like file structures. Tree structures such as B+-trees and ISAM do provide for sequential processing, but require considerable storage for the indices. When sequential processing is needed a table that performs an order-preserving transformation on keys can be used. H is an order-preserving key transform if H(K1) ⩾ H(K2), for all keys K1 K2. We present methodologies for constructing such key transforms, and illustrate them for some real-life key sets. Storage requirements for the table needed to carry out the transformation are less than those needed for the indices.