Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
The design and implementation of a multikey, extensible hashing file addressing scheme and its application as an access method for a relational database are presented. This file organization was developed for Request, a testbed relational database-management system. It offers a viable alternative to indexed sequential files. Access operations, concurrency control, and relational operations are examined. Results of an experimental evaluation are reported.