Analysis and Performance of Inverted Data Base Structures

Communications of the ACM

Volumn 18, Issue 5, 1975, Pages 253-263

  Cárdenas, Alfonso F ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

data base architecture; data base performance and measurement; information storage and retrieval; inverted file organization; query answering; secondary index organization

Indexed keywords

INFORMATION RETRIEVAL SYSTEMS;

DATA PROCESSING;

EID: 0016503879     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/360762.360766     Document Type: Article

References (24)

1. Senko, M. E., Altman, E.B., Astrahan, M.M., and Fehder, P.L. Data structures and accessing in data base systems. IBM Sys. J. 12, 1 (1973), 30-93.
2. Codd, E. F. A relational model of data for large shared data banks. Comm. ACM 13, 6 (June 1970), 377-387.
3. Private communications with E. B. Altman, J. Fry, D. Smith and R. Taylor, CODASYL, Storage Definition and Data Translation Task Group, 1973.
4. Stonebraker, M. Retrieval efficiency using combined indexes. Proc. 1972 ACM SIGFIDET Workshop, pp. 243-256.
5. King, W.F. On the selection of indices for a file. Proc. IFIP Cong. 74, Stockholm, Sweden, 1974.
6. Lum, V.Y., and Ling, H. An optimization problem on the selection of secondary keys. Proc. ACM Nat. Conf., 1971, pp. 349-356.
7. Senko, M. E., Lum, B. Y., and Owens, P. J. A File Organization Evaluation Model (FOREM), Proc. IFIP Cong., Edinburgh, 1968.
8. Patt, Y.Variable length tree structures having minimum average search time. Comm. ACM 12, 2 (Feb. 1969), 72-76.
9. Stanfel, L. E. Tree structures for optimal searching. J. ACM 17, 3 (July 1970), 508-517.
10. Cardenas, A. F. Evaluation and selection of file organization— A model and system. Comm. ACM 16, 9 (Sept. 1973), 540-548.
11. Cardenas, A.F., and Sagamang, J.P. Doubly-chained tree data base organization—Analysis and design strategies. IBM Res. Lab. Tech. Rep. RJ 1374, San Jose, Calif. Apr. 4, 1974, 56 pages.
12. Casey, R.G. Design of tree structures for efficient querying. Comm. ACM 16, 9 (Sept. 1973), 549-556.
13. Bleir, R.F. Treating hierarchical data structures in the SDC Time-shared Data Management System (TDMS). Proc. ACM 22nd Nat. Conf., 1967, pp. 41-49.
14. Lum, V. Y. Multi-attribute retrieval with combined indexes. Comm. ACM 13, 11 (Nov. 1970), 660-665.
15. Lefkovitz, D. File Structures for On-line Systems. Spartan Books, New York, 1969.
16. Nahouraii, E. Direct-access storage-device simulation. Proc. 1973 Summer Computer Simulation Conf., Montreal, July 17-19, 1973, pp. 172-176.
17. Computer System Simulator CSS/II. Program Description and Operations Manual, IBM Pub. SH20-0875-1, Mar. 1971.
18. Ihrer, F. C. A Technical Description of SCERT. Comress Inc. Pub., Rockville, Md.
19. Davies, C.T. A logical concept for the control and management of data. IBM Rep. AR-0803-00, Syst. Develop. Div., Poughkeepsie, N. Y., 1967.
20. CODASYL Development Committee, Language Structure Group. An information algebra, Phase 1 report. Comm. ACM 5, 4 (Apr. 1962), 190-205.
21. Wang, C.P., and Wedekind, H. H. An approach for segment synthesis in logical data base design. IBM Res. Lab. Tech. Rep. RJ 1397, San Jose, Calif., Sept. 1974.
22. Siler, K.F. A model for the evaluation of large scale data retrieval systems. Proc. 42nd Nat. ORSA Meeting, Atlantic City, N. J., Nov. 1972.
23. Lowe, T.C. The influence of data base characteristics and usage on direct access file organization. J. ACM 15, 4 (Oct. 1968), 535-548.
24. System 2000 Reference Manual, MRI Systems Corp., Austin, Tex., 1973.