Advertisement

Partial match retrieval in two-headed disks

  • Yannis Manolopoulos
  • Athena Vakali
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 978)

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.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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–838CrossRefGoogle Scholar
  2. 2.
    Chang, C.C., Chen, C.Y.: Performance of Two-Disk Partition Data Allocations, BIT 27 (1987) 306–314CrossRefMathSciNetGoogle Scholar
  3. 3.
    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–185CrossRefGoogle Scholar
  4. 4.
    Copeland, G., Alexander, W., Boughter, E., Keller, T.: Data Placement in Bubba. Proceedings, ACM SIGMOD Conference, Chicago, Illinois (1988) 99–109Google Scholar
  5. 5.
    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–237Google Scholar
  6. 6.
    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–101Google Scholar
  7. 7.
    Faloutsos, C.: Multiattribute Hashing using Gray Codes. Proceedings, ACM SIG-MOD Conference, Washington D.C., (1986) 228–238Google Scholar
  8. 8.
    Faloutsos, C., Metaxas, D.: Disk Allocation Methods using Error Correcting Codes. IEEE Transactions on Computers 40 (8) (1991) 907–914CrossRefGoogle Scholar
  9. 9.
    Kim, J.U., Chang, H., Kim, T.G.: Multidisk Partial Match File Design with Known Access Pattern. Information Processing Letters 45 (1993) 33–39CrossRefGoogle Scholar
  10. 10.
    Li, J., Srivastava, J., Rotem, D.: CMD — a Multidimensional Declustering Method for Parallel Database Systems. Proceedings, 18th VLDB Conference, Vancouver, Canada (1992) 3–14Google Scholar
  11. 11.
    Manolopoulos, Y., Kollias, J.G.: Estimating Disk Head Movements in Batched Searching. BIT 28 (1988) 27–36CrossRefMathSciNetGoogle Scholar
  12. 12.
    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–442CrossRefGoogle Scholar
  13. 13.
    Manolopoulos, Y.: Probability Distributions for Seek Time Evaluation. Information Sciences 60 (1–2) (1992) 29–40MATHGoogle Scholar
  14. 14.
    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–342CrossRefGoogle Scholar
  15. 15.
    Rivest, R.L.: Partial Match Retrieval Algorithms. SIAM Journal on Computing 5 (1) (1976) 19–50CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Stanfill, C., Kahle, B.: Parallel Free Text Search on the Connection Machine System, Communications of the ACM 29 (12) (1986) 1229–1239Google Scholar
  17. 17.
    Wong, C.K.: Algorithmic Studies in Mass Storage Systems, Computer Science Press, (1983)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Yannis Manolopoulos
    • 1
  • Athena Vakali
    • 1
  1. 1.Department of InformaticsAristotle UniversityThessalonikiGreece

Personalised recommendations