Estimating disk head movement in batched searching
- 13 Downloads
The study considers the problem of evaluating the expected disk head movement when the SCAN disk scheduling policy is used to answer a batch of queries. The two cases examined are: (a) the batched queries are based on primary key values, and (b) each query in the batch is based on secondary key values.
Earlier works assumed that hit cylinders are non-distinct and derived an exact (approximate) formula for the first (second) case. In this paper, both replacement and non-replacement models are examined and new exact (exact and approximate) formulae are derived for the first (second) case. It is shown that earlier and new approximate results may be used instead of the computationally expensive exact formulae.
Categories and Subject DescriptorsD.4.2 H.2.4
General TermsDisks Algorithms Performance
Additional Keywords and PhrasesDisk head movement SCAN scheduling algorithm Batched search Primary and secondary key retrieval Replacement and non-replacement model
Unable to display preview. Download preview PDF.
- 1.F. W. Burton and J. G. Kollias,Optimising disk head movements in secondary key retrievals, The Computer Journal, Vol. 22, No. 3, pp. 206–208, 1979.Google Scholar
- 2.S. Christodoulakis,Analysis of retrieval performance for records and objects using optical disk technology, ACM Transactions on Database Systems, Vol. 12, No. 2, pp. 137–169, 1987.Google Scholar
- 3.W. Feller,An Introduction to Probability Theory and its Applications, John Wiley, 3rd edition, 1968.Google Scholar
- 4.J. G. Kollias,An estimate of the seek time for batched searching of random and index sequential files, The Computer Journal, Vol. 21, No. 2, pp. 132–133, 1978.Google Scholar
- 5.J. G. Kollias and C. H. Papadimitriou,The optimum execution order of queries in linear storage, submitted to International Conference Extending Database Technology (EDBT 88), Venice, Italy, 1988.Google Scholar
- 7.Y. Manolopoulos and J. G. Kollias,Expressions for partly and completely unsuccessful search of sequential and tree-structured files, submitted to IEEE Transactions on Software Engineering, 1987.Google Scholar
- 8.P. Palvia,Expressions for batched searching of sequential and hierarchical files, ACM Transactions on Database Systems, Vol. 10, No. 1, pp. 97–106, 1985.Google Scholar
- 9.J. B. Rothnie and T. Lozano,Attribute based file organization in a paged memory environment, Communications of the ACM, Vol. 17, No. 2, pp. 63–69, 1974.Google Scholar
- 10.B. Schneiderman and V. Goodman,Batched searching of sequential and tree-structured files, ACM Transactions on Database Systems, Vol. 1, No. 3, pp. 268–275, 1976.Google Scholar
- 11.T. J. Teory and T. B. Pinkerton,A comparative analysis of disk scheduling policies, Communications of the ACM, Vol. 15, No. 3, pp. 177–184, 1972.Google Scholar
- 12.T. J. Teorey and J. P. Fry,Design of Database Structures, Prentice Hall, Englewood Cliffs, N.J., 1982.Google Scholar
- 13.S. J. Waters,Estimating magnetic disk seeks, The Computer Journal, Vol. 18, No. 1, pp. 12–19, 1975.Google Scholar
- 14.C. K. Wong,Minimizing expected head movement in one-dimensional and two-dimensional mass storage systems, Computing Surveys of the ACM, Vol. 12, No. 2, pp. 167–178, 1980.Google Scholar
- 15.S. B. Yao,Approximating block accesses in database organizations, Communications of the ACM, Vol. 20, No. 4, pp. 260–261, 1977.Google Scholar
- 16.J. Zahorian, B. Bell and C. Cevcik,Estimating block transfers when record access probabilities are non-uniform, Information Processing Letters, Vol. 16, No. 6, pp. 249–252, 1983.Google Scholar