Programming the logic theory machine
IRE-AIEE-ACM '57 (Western) Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability
A compendium of key search references
ACM SIGIR Forum
Addressing for Random-Access Storage with Multiple Bucket Capacities
Journal of the ACM (JACM)
A Note on the Efficiency of Hashing Functions
Journal of the ACM (JACM)
Performance Measures for Ordered Lists in Random-Access Files
Journal of the ACM (JACM)
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Communications of the ACM - Special 25th Anniversary Issue
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
A note on when to chain overflow items within a direct-access table
Communications of the ACM
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
Communications of the ACM
Secondary key retrieval using an IBM 7090-1301 system
Communications of the ACM
A variant method of file searching
Communications of the ACM
Analysis of a file addressing method
Communications of the ACM
Performance analysis of three related assignment problems
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Analysis of an inverted data base structure
SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
A graduate course in database management
ACM SIGMOD Record
A search algorithm and data structure for an efficient information system
COLING '69 Proceedings of the 1969 conference on Computational linguistics
File organization and addressing
IBM Systems Journal
Application of finite geometry in file organization for records with multiple-valued attributes
IBM Journal of Research and Development
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 48.33 |
Methods for entering random-access files on the basis of one key are briefly surveyed. The widely used chaining method, based on a pseudo-random key transformation, is reviewed in more detail. An efficient generalization of the chaining method which permits recovery on additional keys is then presented.