Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Query processing in main memory database management systems
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Communications of the ACM
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
Query optimization in a memory-resident domain relational calculus database system
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
System M: A Transaction Processing Testbed for Memory Resident Data
IEEE Transactions on Knowledge and Data Engineering
A Study of Index Structures for Main Memory Database Management Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
The Architecture of the Dalí Main-Memory Storage Manager
Multimedia Tools and Applications
Optimizing Main-Memory Join on Modern Hardware
IEEE Transactions on Knowledge and Data Engineering
MIL primitives for querying a fragmented world
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
The objective of this paper is to develop and analyze high performance hash based search methods for main memory databases. We define optimal search in main memory databases as the search that requires at most one key comparison to locate a record. Existing hashing techniques become impractical when they are adapted to yield optimal search in main memory databases because of their large directory size. Multi-directory hashing techniques can provide significantly improved directory utilization over single-directory hashing techniques. A multi-directory hashing scheme, called fast search multi-directory hashing, and its generalization, called controlled search multi-directory hashing, are presented. Both methods achieve linearly increasing expected directory size with the number of records. Their performance is compared to existing alternatives.