Approaches to concurrency in B-trees

  • Y. S. Kwong
  • D. Wood
Part of the Lecture Notes in Computer Science book series (LNCS, volume 88)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AHU]
    Aho, A. V., Hopcroft, J. E. and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. (1974).Google Scholar
  2. [BM]
    Bayer, R. and McCreight, E. Organization and maintenance of large ordered indexes. Acta Informatica 1 (1972), pp. 173–189.Google Scholar
  3. [BS]
    Bayer, R. and Schkolnick, M. Concurrency of operations on B-trees. Acta Informatica 9 (1977), pp. 1–21.Google Scholar
  4. [E]
    Ellis, C. S. Concurrent search and insertion in 2–3 trees. Acta Informatica (1980), to appear.Google Scholar
  5. [GS]
    Guibas, L. J. and Sedgewick, R. A dichromatic framework for balanced trees. Proc. 19th Annual Symposium on Foundation of Computer Science (1978)Google Scholar
  6. [Kn]
    Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass. (1973).Google Scholar
  7. [KL]
    Kung, H. T. and Lehman, P. L. A concurrent database manipulation problem: binary search trees. To appear in ACM Trans. on Database Systems.Google Scholar
  8. [K1]
    Kwong, Y. S. On reduction of asynchronous systems. Theoretical Computer Science (1977), pp. 25–50.Google Scholar
  9. [K2]
    Kwong, Y. S. On the absence of livelocks in parallel programs. Proc. International Symposium on Semantics of Concurrent Computation, Lecture Notes in Computer Science 70, Springer-Verlag (1979), pp. 172–190.Google Scholar
  10. [KW1]
    Kwong, Y. S. and Wood, D. T-trees: a variant of B-trees. Technical Report 78-CS-18, Unit for Computer Science, McMaster University (Nov., 1978).Google Scholar
  11. [KW2]
    Kwong, Y. S. and Wood, D. Concurrency in B-trees, S-trees and T-trees. Technical Report 79-CS-17, Unit for Computer Science, McMaster University (May, 1979).Google Scholar
  12. [KW3]
    Kwong, Y. S. and Wood, D. Concurrent operations in large ordered indexes. Proc. 4th Intl. Symposium on Programming, Lecture Notes in Computer Science 83, Springer-Verlag (1980), pp. 207–222.Google Scholar
  13. [KW4]
    Kwong, Y. S. and Wood, D. On B-trees: routing schemes and concurrency. Proc. 1980 ACM/SIGMOD Intl. Conference on Management of Data (May, 1980).Google Scholar
  14. [KW5]
    Kwong, Y. S. and Wood, D. A solution to the concurrent deletion problem for B-trees. Technical Report 80-CS-7, Unit for Computer Science, McMaster University (April, 1980).Google Scholar
  15. [LY]
    Lehman, P. and Yao, S. B. Efficient locking for concurrent operations on B-trees. In preparation.Google Scholar
  16. [MS]
    Miller, R. E. and Snyder, L. Multiple access to B-trees. Proc. Conference on Information Sciences and Systems (1978).Google Scholar
  17. [P]
    Parr, J. R. An access method for concurrently sharing a B-tree based indexed sequential file. Technical Report 36, Dept. of Computer Science, University of Western Ontario (April, 1977).Google Scholar
  18. [S]
    Samadi, B. B-trees in a system with multiple users. Information Processing Letters 5, 4 (1976), pp. 107–112.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Y. S. Kwong
    • 1
  • D. Wood
    • 1
  1. 1.Unit for Computer ScienceMcMaster UniversityHamiltonCanada

Personalised recommendations