Skip to main content
SpringerLink
Log in

On the Complexity of File Allocation Problem

  • Chapter
Foundations of Data Organization

Abstract

In this paper, we shall analyze the problem of finding an optimal way to distribute buckets among several disks to facilitate parallel searching for all possible queries. It is quite unlikely that there exists a polynomial algorithm to solve the above mentioned problem will 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 of Database Systems, Vol. 4, No. 2, June 1979, pp. 168–179.

    Article  MathSciNet  Google Scholar 

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

  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. Chang, C. C., Du, M. W. and Lee, R. C. T., (1982): The Hierarchical Ordering in Multi-attribute Files, to appear in Information Sciences.

    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 Transactions on Software Engineering, 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., (1981): Symbolic Gray Code as a Perfect Multi-attribute Hashing 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., (1978) : On the Retrieval Time and the Storage Space of Doubly-chained Multiple-attribute Tree Data Base Organization, Policy Analys and Information Systems, Vol. 1, No. 2, Jan. 1978, pp. 22–48.

    Google Scholar 

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

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

    MATH  Google Scholar 

  11. Karp, R. M., (1972) : Reducibility among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, New York, pp. 85–10 3.

    Google Scholar 

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

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

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

    Article  MATH  Google Scholar 

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

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

  17. Tang, T. Y., Buehrer, D. J. and Lee, R. C. T., (1982): On the Complexity of Some Multi-attribute File Design Problems, Proceeding of ICS 1982 Conference, Taichung, Taiwan, Dec. 1982, pp. 649–655.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    C. C. Chang & J. C. Shieh

Authors
  1. C. C. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. C. Shieh
    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., Shieh, J.C. (1987). On the Complexity of File Allocation Problem. 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_14

Download citation

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

  • 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