Efficient Locking for Concurrent Operations on B-trees

ACM Transactions on Database Systems (TODS)

Volumn 6, Issue 4, 1981, Pages 650-670

  Lehman, Philip L ^a   Yao, S Bing ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

B tree; concurrenct algorithms; concurrency controls; consistencey; correctness; data structures; database; index organizations; locking protocols; multiway search trees

Indexed keywords

DATA PROCESSING;

EID: 0019666493     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/319628.319663     Document Type: Article

References (16)

1. Astrahan, M.M., et al. System R: Relational approach to database management. ACM Trans. Database Syst. 1,2 (June 1976), 97-137.
2. Bayer, R., And Mccreight, E. Organization and maintenance of large ordered indexes. Acta Inf 2 (1972), 173-189.
3. Bayer, R., And Schkolnick, M. Concurrency of operations on B-trees. Acta Inf 9 (1977), l-21.
4. Dijrstra, E.W., et al. On-the-fly garbage collection: An exercise in cooperation. Commun. ACM 21,11 (Nov. 1978), 966-976.
5. Dijrstra, E.W. Cooperating sequential processes. In Programming Languages, F. Genuys, Ed. Academic Press, New York, 1968, pp. 43-112.
6. Ellis, C.S. Concurrent search and insertion in 2-3 trees. Tech. Rep. 78-05-01, Dep. Computer Science, Univ. Washington, Seattle, May 1978.
7. Guibas, L.J., And Sedgewick, R. A dichromatic framework for balanced trees. In Proc. 19th Ann. Symp. Foundation of Computer Science, IEEE, 1978.
8. Knuth, D.E. The Art of Computer Programming, vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
9. Kung, H.T., And Lehman, P.L. Concurrent manipulation of binary search trees. ACM Trans. Database Syst. 5,3 (Sept. 1980), 354-382.
10. Kung, H.T., And Song, S.W. A parallel garbage collection algorithm and ita correctness proof. In Proc. 18th Ann. Symp. Foundations of Computer Science, IEEE, Oct. 1977, pp. 120-131.
11. Kwong, Y.S., And Wood, D. Concurrency in B and T-trees. In preparation.
12. Lamport, L. Concurrent reading and writing. Commun. ACM 20,11 (Nov. 1977) 806-811.
13. Miller, R., And Snyder, L. Multiple access to B-trees. In Proc. Conf Information Sciences and Systems (preliminary version), Johns Hopkins Univ., Baltimore, March 1978.
14. Samadi, B. B-trees in a system with multiple users. Inf. Process. Lett. 54 (Oct. 1976),107-112.
15. Steele, G.L., Jr. Multiprocessing compactifying garbage collection. Commun. ACM 18,9 (Sept. 1975), 125-143.
16. Wedekind, H. On the selection of access paths in a data base system. In Data Base Management, J.W. Klimbie and K.L. Koffeman, Eds. North-Holland, Amsterdam, 1974, pp. 385-397.