Concurrency in multidimensional linear hashing

  • M. Ouksel
  • Jalal Abdul-Ghaffar
Short Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 367)


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.


Address Space Split Operation Concurrent Operation Small Search Space Compatibility Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [1]
    Bayer, R. and Schkolnick, M., “Concurrency of Operations on B-Trees,” Acta Informatica, vol. 9, pp. 1–21, 1977.Google Scholar
  2. [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. [3]
    Ellis, Carla S., “Concurrency in Linear Hashing,” ACM Transactions on Databases Systems, vol. 12(2), pp. 195–217, June 1987.Google Scholar
  4. [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. [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. [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. [7]
    Onuegbe, E.O. and Du, H.C., “A Locking Scheme for Associative Retrieval,” Unpublished Paper Google Scholar
  8. [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. [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. [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. [11]
    Salzberg, Betty, “Concurrency in Grid Files,” Inform Systems Journal, vol. 11(3), pp. 235–244, 1986.Google Scholar
  12. [12]
    Samadi, B.S., “B-Trees in A System With Multiple Users,” Inform Process Lett, vol. 5(4), pp. 107–112, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • M. Ouksel
    • 1
  • Jalal Abdul-Ghaffar
    • 2
  1. 1.Computer Learning Research (CLEAR) CenterThe University of Texas at DallasRichardson
  2. 2.Computer Science DepartmentUniversity of Petroleum and MineralsDhahran

Personalised recommendations