Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
A stochastic evaluation model for database organizations in data retrieval systems
Communications of the ACM
| Hi-index | 0.00 |
The need for inexpensive data storage continues to grow and tape reels are usually used. For large data aggregations with even a few retrieval applications, it may not be as economical to store full reels as to split the data into smaller sized files. It is assumed that the data aggregation consists of a set of items, stored sequentially as several files on similar physical media. Query requests are made randomly, so that each item is equally likely to be requested. A solution is developed for the average access time into sequential files whose access function is directly related to the position of the query elements in the file. An application is described and illustrated. This shows the relationship between the size of the files, the number of items in a batched retrieval operation, and the cost factors.