V. Y. Lum
Abstract
In this paper a file organization scheme designed to replace the use of the popular secondary index filing scheme (or inverted files on secondary key fields) is described. Through the use of redundancy and storing keys (or access numbers of the records) that satisfy different combinations of secondary index values in “buckets,” it is possible to retrieve all keys satisfying any input query derived from a subset of fields by a single access to an index file, although each bucket may be used for many combinations of values and a combination of buckets may be required for a given query.
The method which, in its degenerate case, becomes the conventional secondary index filing scheme works similarly but has the following advantages: (1) the elimination of multiple accesses in many cases; (2) the elimination of false drops; (3) the elimination of computer time to perform intersection of key sets each qualified for one secondary index field only; and (4) the avoidance of long strings of keys when an index field appearing in a query has very few possible values. Redundancy, in some cases, is the same as the secondary indexing method. In the general case, trade-off between the number of accesses for query and redundancy exists.
- 1 DAVIS, D. R. AND LIN, A. D. Secondary key retrieval using an IBM 7090-1301 system". Comm. ACM 8, 4 (Apr. 1965), 243- 246. Google Scholar
Digital Library
- 2 General Information System: Application Description-IBM E20-0179.Google Scholar
- 3 ABRAHAM, C. W., GHOSH, S. P., AND RAY-CHAUDHURI, D. K. File organization schemes based on finite geometries. Information and Control 12, 2 (Feb. 1968), 143-163.Google ScholarCross Ref
- 4 GHOSH, S. P. AND ABRAHAM, C. W. Application of finite geometry in file organization for records with multiple-valued attributes. IBM J. Res. Develop. 12, 2 (1968), 180-187.Google ScholarDigital Library
- 5 RYSER, H. J. Combinatorial Mathematics. Wiley, New York, 1963.Google ScholarCross Ref
- 6 VORHAUS, A. H., AND WILLS, R. D. The time-shared data management system: A new approach to data management. System Develop. Corp. doc. SP-2747, 1967 (now Xerox Data Systems, El Segundo, Calif.)Google Scholar
- 7 BLEIER, R. E., AND VORHAUS, A. H. File organization in the SDC time-shared data management system (TDMS). Proc. IFIP Cong. 1968, Vol. 2, North Holland Pub. Co., Amsterdam, pp. 1245-1252.Google Scholar
- 8 BOSE, R. C., ABRAHAM, C. T. AND GHOSH, S. P. File organization of records for multiple valued attributes for multiattribute queries. IBM Report RC-1886.Google Scholar
Recommendations
Retrieval—Update speed tradeoffs using combined indices
In a paper in the November 1970 Communications of the ACM, V.Y. Lum introduced a technique of file indexing named combined indices. This technique permitted decreased retrieval time at the cost of increased storage space. This paper examines combined ...
Minimum cost selection of secondary indexes for formatted files
Secondary indexes are often used in database management systems for secondary key retrieval. Although their use can improve retrieval time significantly, the cost of index maintenance and storage increases the overhead of the file processing ...
The use of normal multiplication tables for information storage and retrieval
This paper describes a method for the organization and retrieval of attribute based information systems, using the normal multiplication table as a directory for the information system. Algorithms for the organization and retrieval of information are ...
Comments