Table Lookup Techniques

Authors:
C. E. Price
Affiliations:
Information Systems Department, Nuclear Division, Union Carbide Corporation, Oak Ridge, Tennessee
Venue:
ACM Computing Surveys (CSUR)
Year:
1971

Citing 6
Cited 10

An Elementary Discussion of Compiler/Interpreter Writing

ACM Computing Surveys (CSUR)
Key-to-address transform techniques: a fundamental performance study on large existing formatted files

Communications of the ACM
Scatter storage techniques

Communications of the ACM
Randomized binary searching with tree structures

Communications of the ACM
Storage and search properties of a tree-organized memory system

Communications of the ACM
Use of tree structures for processing files

Communications of the ACM

Hashing for Dynamic and Static Internal Tables

Computer
A compendium of key search references

ACM SIGIR Forum
Reasoning about naming systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Hash Table Methods

ACM Computing Surveys (CSUR)
Use of an inverted file structure for interactive retrieval of computer program abstracts

ACM SIGMOD Record
A graduate course in database management

ACM SIGMOD Record
A system structure and data structure for an interactive on-line thesaurus

ACM SIGIR Forum
Information storage and retrieval: a survey and functional description

ACM SIGIR Forum
Recent developments in the theory of data structures

Computer Languages
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	0.01

Visualization

Abstract

Consideration is given to the basic methodology for table searching in computer programming. Only static tables are treated, but references are made to techniques for handling dynamic tables. Methods described are: sequential search, merge search, binary search, estimated entry, and direct entry. The rationale of key transformation is discussed, with some consideration of methods of “hash addressing.” A general guide to technique selection is given in conclusion.