1984 · 18 citations · 11 references
ComputingComputer ScienceComputer SystemsCryptographyInformation RetrievalStorage SystemsData Storage SystemsFile StorageFile System AnalysisFile SystemsHash FunctionsHash TablesHashingHashing-based RetrievalKeysLogical-to-physical Address MappingPartition RepresentationQualificationRetrievalTree Hashing
A new method for multikey access suitable for dynamic files is proposed that transforms multiple key values into a logical address This method is based on a new structure, called predicate tree, that represents the function applied to several keys A predicate tree permits to specify in a unified way various hashing schemes by allowing for different definitions of predicates A logical address qualifies a space partition of a file according to its predicate tree This address is seen as a single key by a digital hashing method which transforms it into a physical address This method is used to address records in a file and to transform a retrieval qualification on a file into a set of partitions to access Finally, a qualitative analysis of the behavior of the method is given which exhibits its value
11
Extendible hashing—a fast access method for dynamic files
Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger et al. · ACM Transactions on Database Systems · 1979 · 669 citations · Full text
Per-Åke Larson · BIT Numerical Mathematics · 1978 · 185 citations
Virtual hashing: a dynamically changing hashing
Witold Litwin · Very Large Data Bases · 1978 · 70 citations