Skip to main content
SpringerLink
Log in
Book cover

International Conference on Scientific and Statistical Database Management

SSDBM 1988: Statistical and Scientific Database Management pp 133–140Cite as

Orthogonal range retrieval using bucket address hashing

  • Contributed Papers
  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 339))

Abstract

This paper is concerned with the multi-attribute file system design problem for orthogonal range retrieval. A formula which can be used to determine the optimal number of bits of the bucket address to assign to each attribute of a record is derived, assuming that all the queries are not equally likely. Also, an algorithm which can be applied to produce optimal integer solutions is presented. It will be seen that an optimal file structure for partial match queries does not guarantee the optimal file structure for orthogonal range queries.

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

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, pp. 168–179.

    Google Scholar 

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

    Google Scholar 

  3. Burkhard, W. A., (1976a): "Hashing and Trie Algorithms for Partial Match Retrieval," ACM Trans. Database Syst., Vol. 1, No. 2, pp. 175–187.

    Google Scholar 

  4. Burkhard, W. A., (1976b): "Partial Match Retrieval," BIT, Vol. 16, No. 1, pp. 13–31.

    Google Scholar 

  5. Chang, C. C., (1984a): "Optimal Information Retrieval When Queries Are Not Random," Information Sciences, Vol. 34, pp. 199–223.

    Google Scholar 

  6. Chang, C. C., (1984b): "Optimal Partial Match Retrieval When The Number of Buckets is a Power of Prime," Proceedings of International Computer Symposium, Taipei, Taiwan, Dec. 1984, pp. 807–813.

    Google Scholar 

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

    Google Scholar 

  8. Chang, C. C., Lee, R. C. T. and Du, H. C., (1980): "Some Properties of Cartesian Product Files," Proceedings of ACM-SIGMOD 1980 Conference, pp. 157–168.

    Google Scholar 

  9. 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, pp. 235–249.

    Google Scholar 

  10. Chang, C. C., and Su, D. H., (1987): "Performance Analyses of Multiattribute Files Based upon Multiple Key Hashing Functions and Haphazard Files," Journal of the Chinese Institute of Engineers, Vol. 10, No. 1, pp. 99–105.

    Google Scholar 

  11. Du, H. C., (1985): "On the File Design Problem for Partial Match Retrieval," IEEE Transactions on Software Engineering, Vol. SE-11, No. 2, pp. 213–222.

    Google Scholar 

  12. Lee, R. C. T. and Tseng, S. H., (1979): "Multi-key Sorting," Policy Analysis and Information Systems, Vol. 3, No. 2, 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, pp. 160–174.

    Google Scholar 

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

    Google Scholar 

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

    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, pp. 63–69.

    Google Scholar 

  17. Tang, T. Y., Buehrer, D. J. and Lee, R. C. T., (1985): "On the Complexity of Some Multi-attribute File Design Problem," Information System, Vol. 10, No. 1, pp. 21–25.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. C. C. Chang is with the Institute of Applied Mathematics National Chung Hsing University, Taichung, Taiwan 40227 Republic of China

    C. C. Chang

  2. C. Y. Chen is with the Department of Electronics, Feng Chia University, Taichung, Taiwan 40724 Republic of China

    C. Y. Chen

Authors
  1. C. C. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Y. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurizio Rafanelli John C. Klensin Per Svensson

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chang, C.C., Chen, C.Y. (1989). Orthogonal range retrieval using bucket address hashing. In: Rafanelli, M., Klensin, J.C., Svensson, P. (eds) Statistical and Scientific Database Management. SSDBM 1988. Lecture Notes in Computer Science, vol 339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027510

Download citation

  • DOI: https://doi.org/10.1007/BFb0027510

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50575-4

  • Online ISBN: 978-3-540-46045-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation