Batched searching of sequential and tree structured files

ACM Transactions on Database Systems (TODS)

Volumn 1, Issue 3, 1976, Pages 268-275

  Shneiderman, Ben ^a   Goodman, Victor ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

B trees; batched searching; data structures; database systems; file management; indexes; informational retrieval; sequential files; tree structures

Indexed keywords

EID: 84976669473     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/320473.320487     Document Type: Article

References (10)

1. Meadow, C.T. The Analysis of Information Systems. Melville Pub. Co., Los Angeles, 2nd ed., 1973, pp. 303-330.
2. Salton, G. Automatic Information Organization and Retrieval. McGraw-Hill, New York, 1968, pp. 243ff.
3. Knuth, D.E. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
4. Stocker, P.M., and Dearnley, P.A. A self-organising data base management system. In Data Base Management, J.W. Klimbie and K.L. Koffeman, Eds., North-Holland Pub. Co., Amsterdam, 1974, pp. 337-348.
5. Nijssen, G.M. Efficient batch updating of a random file. Proc. 1971 ACM-SIGFIDET Workshop—Data Description, Access and Control, pp. 173-186.
6. Hwang, K., and Yao, S.B. Parallel processing of multiway search trees. Proc. 1975 Conf. on Computer Graphics, Pattern Recognition and Data Structures, IEEE Computer Soc., May 14, 1975, pp. 170-176.
7. Shneiderman, B. A model for optimizing indexed file structures. Internat. J. of Computer and Information Sciences 3, 1 (1974), 93-103.
8. Bayer, R., and McCreight, E. Organization and maintenance of large ordered indexes. Acta Informatica 1 (1972), 173-189.
9. Friedman, D.P., and Wise, D.S. An environment for multiple-valued recursive procedures. Tech. Report 40, Comput. Sci. Dep., Indiana U., Bloomington, Ind., Oct. 1975.
10. Aho, A.V., and Corasick, M.K. Efficient string matching: An aid to bibliographic search. Comm. ACM 18, 6 (June 1975), 333-340.