Batched searching of sequential and tree structured files
- 1 September 1976
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 1 (3) , 268-275
- https://doi.org/10.1145/320473.320487
Abstract
The technique of batching searches has been ignored in the context of disk based online data retrieval systems. This paper suggests that batching be reconsidered for such systems since the potential reduction in processor demand may actually reduce response time. An analysis with sample numerical results and algorithms is presented.Keywords
This publication has 4 references indexed in Scilit:
- Efficient string matchingCommunications of the ACM, 1975
- A model for optimizing indexed file structuresInternational Journal of Parallel Programming, 1974
- A nucleus of a theorem-prover described inAlgol-68International Journal of Parallel Programming, 1974
- Organization and maintenance of large ordered indexesActa Informatica, 1972