Abstract
The performance of a disk with two heads per surface separated by a fixed number of cylinders is examined. We derive the probability distribution of arm stops, the expected number of stops as well as the expected number of cylinder clusters, i.e. the number of sets of consecutive compound cylinders. In comparison with a single-headed disk, it is shown that the performance gain may reach 50% on the average.
Preview
Unable to display preview. Download preview PDF.
References
Calderbank, A.R., Coffman, E.G., Flatto, L.: Optimum Head Separation in a Disk System with Two Read/Write Heads. Journal of the ACM 31 (4) (1984) 826–838
Chang, C.C., Chen, C.Y.: Performance of Two-Disk Partition Data Allocations, BIT 27 (1987) 306–314
Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H., Patterson, D.A.: RAID-High-performance, Reliable Secondary Storage. ACM Computing Surveys 26 (2) (1994) 145–185
Copeland, G., Alexander, W., Boughter, E., Keller, T.: Data Placement in Bubba. Proceedings, ACM SIGMOD Conference, Chicago, Illinois (1988) 99–109
DeWitt, D., Gerber, R.H., Graefe, G., Heytens, M.L., Kumar, K.B., Muralikrishna, M.: GAMMA — a High Performance Database Machine. Proceedings, 12th VLDB Conference, Kyoto, Japan (1986) 228–237
Du, H.C., Sobolewski, J.S.: Disk allocation for Cartesian Product Files on Multiple-disk Systems. ACM Transactions on Database Systems 7 (1) (1985) 82–101
Faloutsos, C.: Multiattribute Hashing using Gray Codes. Proceedings, ACM SIG-MOD Conference, Washington D.C., (1986) 228–238
Faloutsos, C., Metaxas, D.: Disk Allocation Methods using Error Correcting Codes. IEEE Transactions on Computers 40 (8) (1991) 907–914
Kim, J.U., Chang, H., Kim, T.G.: Multidisk Partial Match File Design with Known Access Pattern. Information Processing Letters 45 (1993) 33–39
Li, J., Srivastava, J., Rotem, D.: CMD — a Multidimensional Declustering Method for Parallel Database Systems. Proceedings, 18th VLDB Conference, Vancouver, Canada (1992) 3–14
Manolopoulos, Y., Kollias, J.G.: Estimating Disk Head Movements in Batched Searching. BIT 28 (1988) 27–36
Manolopoulos, Y., Kollias, J.G.: Performance of a Two-headed Disk System when Serving Database Queries under the SCAN Policy. ACM Transactions on Database Systems 14 (3) (1989) 425–442
Manolopoulos, Y.: Probability Distributions for Seek Time Evaluation. Information Sciences 60 (1–2) (1992) 29–40
Page, I.P., Wood, R.T.: Empirical Analysis of a Moving Headed Disk Model with. Two Heads Separated by a Fixed Number of Tracks. The Computer Journal 24 (4) (1981) 339–342
Rivest, R.L.: Partial Match Retrieval Algorithms. SIAM Journal on Computing 5 (1) (1976) 19–50
Stanfill, C., Kahle, B.: Parallel Free Text Search on the Connection Machine System, Communications of the ACM 29 (12) (1986) 1229–1239
Wong, C.K.: Algorithmic Studies in Mass Storage Systems, Computer Science Press, (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manolopoulos, Y., Vakali, A. (1995). Partial match retrieval in two-headed disks. In: Revell, N., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1995. Lecture Notes in Computer Science, vol 978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049156
Download citation
DOI: https://doi.org/10.1007/BFb0049156
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60303-0
Online ISBN: 978-3-540-44790-0
eBook Packages: Springer Book Archive