Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Data Organization and Algorithms

FODO 1989: Foundations of Data Organization and Algorithms pp 233–240Cite as

Concurrency in multidimensional linear hashing

  • Short Presentations
  • Conference paper
  • First Online:

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

Abstract

Concurrency control schemes are developed to improve the throughput in a shared database by providing mechanisms which synchronize operations issued by concurrently executing processes. In this paper, we present efficient algorithms for concurrent operations in two structures; namely Multi-dimensional Linear Hashing and Interpolation-Based Index Maintenance. Both of these structures are extensions of Linear hashing to the multi-dimensional case. The concurrent scheme presented is an adaptation of the one proposed for linear hashing. The algorithms include searching for, inserting, and deleting data elements. These algorithms support a high degree of concurrency and are shown to be correct based on the restrictions imposed by the compatibility scheme.

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.

7. References

  1. Bayer, R. and Schkolnick, M., “Concurrency of Operations on B-Trees,” Acta Informatica, vol. 9, pp. 1–21, 1977.

    Google Scholar 

  2. Burkhard, Walter A., “Interpolation-Based Index Maintenance,” Proc Second ACM-SIGACT-SIGMOD Symp on Principles of Database System, pp. 76–85, 1983.

    Google Scholar 

  3. Ellis, Carla S., “Concurrency in Linear Hashing,” ACM Transactions on Databases Systems, vol. 12(2), pp. 195–217, June 1987.

    Google Scholar 

  4. Kwong, Yat-Sang and Wood, Derick, “A new Method for Concurrency in B-Trees,” IEEE Transactions on Software Engineering, vol. SE-8(3), pp. 211–222, May 1982.

    Google Scholar 

  5. Lehman, Philip L. and Yao, S. Bing, “Efficient Locking for Concurrent Operations on B-Trees,” ACM Transactions on Database Systems, vol. 6(4), pp. 650–670, December 1981.

    Google Scholar 

  6. Litwin, Witold, “Linear Hashing: A New Tool for File and Table Addressing,” In Proceedings, 6th Conf on very Large Databases, pp. 212–223, 1980.

    Google Scholar 

  7. Onuegbe, E.O. and Du, H.C., “A Locking Scheme for Associative Retrieval,” Unpublished Paper

    Google Scholar 

  8. Ouksel, M. and Scheuermann, P., “Multi-dimensional Storage Mappings,” Proc Second ACM-SIGACT-SIGMOD Symp. on Principles of Database Systems, pp. 90–105, 1983.

    Google Scholar 

  9. Ouksel, M. and Scheuermann, P., “Implicit Data Structures for Linear Hashing Schemes,” Information Processing Letters, vol. 29(4), pp. 183–189, 1988.

    Google Scholar 

  10. Sagiv, Yehashua, “Concurrent operations on B-trees with overtaking,” Proc of the 4th ACM-SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 28–37, 1985.

    Google Scholar 

  11. Salzberg, Betty, “Concurrency in Grid Files,” Inform Systems Journal, vol. 11(3), pp. 235–244, 1986.

    Google Scholar 

  12. Samadi, B.S., “B-Trees in A System With Multiple Users,” Inform Process Lett, vol. 5(4), pp. 107–112, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Learning Research (CLEAR) Center, The University of Texas at Dallas, 75083-0688, Richardson, TX

    M. Ouksel

  2. Computer Science Department, University of Petroleum and Minerals, 31261, Dhahran

    Jalal Abdul-Ghaffar

Authors
  1. M. Ouksel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jalal Abdul-Ghaffar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Witold Litwin Hans-Jörg Schek

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ouksel, M., Abdul-Ghaffar, J. (1989). Concurrency in multidimensional linear hashing. In: Litwin, W., Schek, HJ. (eds) Foundations of Data Organization and Algorithms. FODO 1989. Lecture Notes in Computer Science, vol 367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51295-0_132

Download citation

  • DOI: https://doi.org/10.1007/3-540-51295-0_132

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51295-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation