Skip to main content
SpringerLink
Log in

Consecutive Retrieval Organization as a File Allocation Scheme on Multiple Disk Systems

  • Chapter
Foundations of Data Organization

  • 137 Accesses

Abstract

Consecutive retrieval organization can be used to arrange records into buckets. In this paper, we shall propose an important organization, called bucket-oriented consecutive retrieval organization which can be used to arrange buckets into different disks. Some interesting properties of this new organization will be discussed and proved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A. V. and Ullman, J. D., (1979) : Optimal Partial-match Retrieval when Fields are Independently Specified, ACM Transactions on Database Systems, Vol. 4, No. 2, June 1979, pp. 168–179.

    Article  MathSciNet  Google Scholar 

  2. Al-Pedaghi and Chin, Y. H., (1979): Algorithmic Approach to the Consecutive Retrieval Property, International Journal of Computer and Information Science, Vol. 8, No. 4, 1979 , pp. 279–301.

    Article  Google Scholar 

  3. Bentley, J. L. and Friedman, J. H., (1979): Data Structures for Range Searching, Computing Surveys , Vol. 11, No. 4, Dec. 1979, pp. 397–409.

    Article  Google Scholar 

  4. Bolour, A., (1979) : Optimality Properties of Multiple Key Hashing Functions , Journal of the Association for Computing Machinery, Vol. 26 , No. 2, April 1979, pp. 196–210.

    MathSciNet  MATH  Google Scholar 

  5. Chang, C. C., Du, M. W. and Lee, R. C. T., (1984): Performance Analysis of Cartesian Product Files and Random Files, IEEE Trans. Software Eng., Vol. SE-10 , No. 1, Jan. 1984, pp. 88–99.

    Article  MathSciNet  Google Scholar 

  6. Chang, C. C., Lee , R. C. T. and Du, H. C., (1980) : Some Properties of Cartesian Product Files, Proc. ACM-SIGMOD 1980 Conference, Santa Monica, Calif., May 1980, pp. 157–168.

    Google Scholar 

  7. Chang, C. C., Lee , R. C. T. and Du, M. W., (1982) : Symbolic Gray Code as a Perfect Multi-attribute Hashing Scheme for Partial Match queries, IEEE Transactions on Software Engineering, Vol. SE-8, No. 3, May 1982, pp. 235–249.

    Article  MathSciNet  Google Scholar 

  8. Chang, J. M. and Fu, K. S., (1981): Extended K-d Tree Database Organization: A Dynamic Multi-attribute Clustering Method, IEEE Trans. Software Eng., Vol. SE-7, No. 3, May 1981, pp. 284–290.

    Article  MathSciNet  Google Scholar 

  9. Chang, C. C. and Su, D. H., (1983a) : Some Properties of Multiattribute File System Based upon Multiple Key Hashing Functions, Proceedings of the 21-st Annual Allerton Conference on Communication, Control and Computing, Urbana, Illinois, Oct. 1983, pp. 675–682.

    Google Scholar 

  10. Chang, C. C. and Su, D. H., (1983b) : Application of a Heuristic Algorithm to Design Multiple Key Hashing Functions, Proceedings of NCS 1983 Conference, Hsinchu, Taiwan, Dec. 1983, pp. 218–231.

    Google Scholar 

  11. Chang, C. C. and Su, D. H., (1984): Performance Analysis of Multiattribute Files Based upon Multiple Key Hashing Functions and Haphazard Files, Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan, Tech. Report.

    Google Scholar 

  12. Du, H. C. and Sobolewski, J. S., (1982) : Disk Allocation for Cartesian Product Files on Multiple Disk Systems, ACM Trans. Database Systems, Vol. 7, March, pp. 82–101.

    Article  MATH  Google Scholar 

  13. Ghosh, S. P., (1972) : File Organization: The Consecutive Retrieval Property, Comm. ACM, Vol. 15, pp. 802–808.

    Article  MATH  Google Scholar 

  14. Ghosh, S. P., (1973): On the Theory of Consecutive Storage Relevant Records, Information Sci., Vol. 6, pp. 109.

    Article  Google Scholar 

  15. Ghosh, S. P., (1977) : Data Base Organization for Data Management, Academic Press, N. Y., 1977.

    MATH  Google Scholar 

  16. Jakobsson, M., (1980): Reducing Block Accesses in Inverted Files by Partial Clustering, Inform. Systems, Vol. 5, No. 1, 1980, pp. 1–5.

    Article  MATH  Google Scholar 

  17. Lee, R. C. T., (1981): Clustering Analysis and Its Applications, Advances in Information Systems Science, Plenum Press, N. Y., (edited by J. T. Tou) 1981, pp. 169–287.

    Google Scholar 

  18. Lee, R. C. T. and Tseng, S. H., (1979): Multi-key Sorting, Policy Analysis and Information Systems, Vol. 3, No. 2, Dec. 1979, pp. 1–20.

    Google Scholar 

  19. Lin, W. C., Lee, R. C. T. and Du, H. C., (1979): Common Properties of Some Multi-attribute File Systems, IEEE Transactions on Software Engineering, Vol. SE-5 , No. 2, March 1979, pp. 160–174.

    Article  MathSciNet  Google Scholar 

  20. Liou, J. H. and Yao, S. B., (1977) : Multi-dimensional Clustering for Data Base Organizations, Information Systems , Vol. 2, 1911 ,pp. 187–198.

    Article  MATH  Google Scholar 

  21. Nakano, T., (1973a): A Characterization of Intervals; The Consecutive (one’s or retrieval) Property, Comment Math. Univ. St. Paul., 22, pp. 49–59.

    Google Scholar 

  22. Nakano, T., (1973b): A Remark on The Consecutivity of Incidence Matrices, Comment Math. Univ. St. Paul., Vol. 22, pp. 61–62.

    Google Scholar 

  23. Rivest, R. L., (1976) : Partial-match Retrieval Algorithms, SIAM Journal on Computing, Vol. 14, No. 1, March 1976, pp. 19–50.

    Article  MathSciNet  Google Scholar 

  24. Rothnie, J. B. and Lozano, T., (1974) : Attribute Based File Organization in a Paged Memory Environment, Communications of the Association for Computing Machinery, Vol. 17, No. 2, Feb. 1974, pp. 63–69.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan

    Chin-Chen Chang & Jaw-Ji Shen

Authors
  1. Chin-Chen Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaw-Ji Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM Almaden Research Center, San Jose, California, USA

    Sakti P. Ghosh

  2. Kyushu University, Fukuoka, Japan

    Yahiko Kambayashi

  3. Kobe University, Kobe, Japan

    Katsumi Tanaka

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Plenum Press, New York

About this chapter

Cite this chapter

Chang, CC., Shen, JJ. (1987). Consecutive Retrieval Organization as a File Allocation Scheme on Multiple Disk Systems. In: Ghosh, S.P., Kambayashi, Y., Tanaka, K. (eds) Foundations of Data Organization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1881-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1881-1_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9048-3

  • Online ISBN: 978-1-4613-1881-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation