A variant method of file searching
Communications of the ACM
An indirect chaining method for addressing on secondary keys
Communications of the ACM
Communications of the ACM
Addressing multidimensional arrays
Communications of the ACM
Communications of the ACM
Communications of the ACM
Analysis of a file addressing method
Communications of the ACM
A programming language
Planning a computer system: Project Stretch
Planning a computer system: Project Stretch
Requirements for a rapid access data file
AIEE-IRE '56 (Western) Papers presented at the February 7-9, 1956, joint ACM-AIEE-IRE western computer conference
The RAMAC data-processing machine: system organization of the IBM 305
AIEE-IRE '56 (Eastern) Papers and discussions presented at the December 10-12, 1956, eastern joint computer conference: New developments in computers
Contrasts in large file memories for large-scale computers
IRE-ACM-AIEE '58 (Western) Proceedings of the May 6-8, 1958, western joint computer conference: contrasts in computers
Methods of file organization for efficient use of IBM RAMAC files
IRE-ACM-AIEE '58 (Western) Proceedings of the May 6-8, 1958, western joint computer conference: contrasts in computers
File searching using variable length keys
IRE-AIEE-ACM '59 (Western) Papers presented at the the March 3-5, 1959, western joint computer conference
Key addressing of random access memories by radix transformation
AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.00 |
The principal approaches to random-access file organization and addressing are reviewed in this paper. The review is general, in the sense that it is relatively independent of specific equipment. In the case of a number of unsettled questions, the author's evaluations of alternatives are included. The relation between sorting and random-access file addressing is clarified by viewing both as belonging to a common class of ordering operations. Basic considerations of both sequential and randomaccess approaches, arithmetical key-to-address transformation methods with their overflow problems, and table lookup methods are discussed. Results of an experimental analysis of key transformation techniques are presented.