This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V., Hopcroft, J. E. and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. (1974).
Bayer, R. and McCreight, E. Organization and maintenance of large ordered indexes. Acta Informatica 1 (1972), pp. 173–189.
Bayer, R. and Schkolnick, M. Concurrency of operations on B-trees. Acta Informatica 9 (1977), pp. 1–21.
Ellis, C. S. Concurrent search and insertion in 2–3 trees. Acta Informatica (1980), to appear.
Guibas, L. J. and Sedgewick, R. A dichromatic framework for balanced trees. Proc. 19th Annual Symposium on Foundation of Computer Science (1978)
Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass. (1973).
Kung, H. T. and Lehman, P. L. A concurrent database manipulation problem: binary search trees. To appear in ACM Trans. on Database Systems.
Kwong, Y. S. On reduction of asynchronous systems. Theoretical Computer Science (1977), pp. 25–50.
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.
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).
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).
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.
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).
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).
Lehman, P. and Yao, S. B. Efficient locking for concurrent operations on B-trees. In preparation.
Miller, R. E. and Snyder, L. Multiple access to B-trees. Proc. Conference on Information Sciences and Systems (1978).
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).
Samadi, B. B-trees in a system with multiple users. Information Processing Letters 5, 4 (1976), pp. 107–112.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwong, Y.S., Wood, D. (1980). Approaches to concurrency in B-trees. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022520
Download citation
DOI: https://doi.org/10.1007/BFb0022520
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive