Skip to main content
SpringerLink
Log in

On Strict Optimality Property of Allocating Binary Cartesian Product Files on Multiple Disk Systems

  • Chapter
Foundations of Data Organization

  • 137 Accesses

Abstract

In this paper, we shall first review the progress made in the area of allocating multi-attribute file systems on multiple disks. We shall explore the strictly optimal allocation methods for binary Cartesian product files. A very important theorem concerning the sufficient and necessary conditions of whether a binary Cartesian product file have a strictly optimal allocation method on multiple disks or not shall be shown.

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-Fedaghi and Chin, Y. H., (1979) : Algorithmic Approach to the Consecutive Retrieval Property, International Journal of Information Sciences, Vol. 8, No. 4, 1979, pp. 279–301.

    Article  MathSciNet  MATH  Google Scholar 

  3. 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 

  4. Burkhard, W. A., (1976) : Hashing and Trie Algorithms for Partial Match Retrieval, ACM Transactions on Database Systems, Vol. 1, No. 2, June 1976, pp. 175–187.

    Article  Google Scholar 

  5. Burkhard, W. A., (1979) : Partial Match Hashing Coding: Benefits of Redundancy, ACM Transactions on Database Systems , Vol. 4, No. 2, June 1979, pp. 228–239.

    Article  Google Scholar 

  6. Chang, C. C., (1982) : A Survey of Multi-Key File Design, Proceedings of the First Conference on Computer Algorithms, Hsinchu, Taiwan, July 1982, pp. 3-1 – 3-62.

    Google Scholar 

  7. Chang, C. C., Du, M. W., and Lee, R. C. T., (1983): The Hierarchical Structure in MuIti-attribute Files, to appear in Information Science.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Chang, C. C., Lee, R. C. T. and Du, H. C., (1980) : Proc. ACM-SIGMOD 1980 Conference, Santa Monica, Calif., May 1980, pp. 157–168.

    Chapter  Google Scholar 

  10. 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 

  11. Chang, C. C. and Su, D. H., (1983a): Some Properties of Multi-attribute Files 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 

  12. 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 

  13. 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 

  14. Du, H. C., (1982) : Concurrent Disk Accessing for Partial Match Retrieval, Computer Science Department, University of Minnesota, Minneapolis, 1982.

    Google Scholar 

  15. Du, H. C. and Lee, R. C. T., (1980) : Symbolic Gray Code as a Multi-Key Hashing Functions, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-2, No. 1, Jan. 1980, pp. 83–90.

    Article  Google Scholar 

  16. 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 1982, pp. 82–101.

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  18. 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 

  19. 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 

  20. 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 

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

    Article  MATH  Google Scholar 

  22. 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 

  23. Rothine, 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

    C. C. Chang & L. S. Lian

Authors
  1. C. C. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. S. Lian
    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, C.C., Lian, L.S. (1987). On Strict Optimality Property of Allocating Binary Cartesian Product Files 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_13

Download citation

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

  • 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