Concurrent manipulation of binary search trees

ACM Transactions on Database Systems (TODS)

Volumn 5, Issue 3, 1980, Pages 354-382

  Kung, H T ^a   Lehman, Philip L ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

binary search trees; concurrency controls; concurrent algorithm; consistency; correctness; data structures; databases; locking protocols

Indexed keywords

DATA PROCESSING;

EID: 0019054806     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/320613.320619     Document Type: Article

References (24)

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. 1, 3 (1972), 173-189.
3. Bayer, R., and Schkolnick, M. Concurrency of operations on B-trees. Acta Inf. 9, 1 (1977), 121.
4. Dijkstra, E.W. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1976.
5. Dijkstra, E.W., Lamport, L., Martin, A.J. Scholten, C.S., and Steffens, E.F.M. On-the-fly garbage collection: An exercise in cooperation. Commun. ACM 21, 11 (Nov. 1978), 966-976.
6. Ellis, C.S. Concurrent search and insertion in 2-3 trees. Tech. Rep. 78-05-01, Dep. Computer Science, Univ. Washington, Seattle, 1978.
7. Eswaran, K.P., Gray, J.N., Lorie, R.A., and Traiger, I.L. The notions of consistency and predicate locks in a database system. Commun. ACM 19, 11 (Nov. 1976), 624-633.
8. Gray, J. Notes on database operating systems. Lecture Notes in Computer Science 60: Operating Systems, Berlin, Germany, Feb. 1978, pp. 393-481.
9. Guibas, L.J., and Sedgewick, R. A dichromatic framework for balanced trees. Proc. 19th Ann. Symp. Foundations of Computer Science, IEEE, 1978.
10. Knuth, D.E. The Art of Computer Programming, vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
11. Kung, H.T. The Structure of Parallel Algorithms, vol. 19, Advances in Computers. Academic Press, New York, 1980. (Also available as a CMU Computer Science Dep. Tech. Rep., Aug. 1979.)
12. Kung, H.T., and Papadimitriou, C.H. An optimality theory of concurrency control for databases. Proc. ACM SIGMOD 1979 Int. Conf. Management of Data, 1979, pp. 116-126.
13. Kung, H.T., and Song, S.W. A parallel garbage collection algorithm and its correctness proof. Proc. 18th Ann. Symp. Foundations of Computer Science, 1977, pp. 120-131.
14. Lamport, L. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3, 2 (March 1977), 125-143.
15. Lamport, L. Concurrent reading and writing. Commun. ACM 20, 11 (Nov. 1977), 806-811.
16. Lehman, P.L., and Yao, S.B. Efficient locking for concurrent operations on B-trees. To appear in ACM Trans. Database Syst.
17. Manna, Z., and Waldinger, R. The logic of computer programming. IEEE Trans. Softw. Eng. SE-4, 3 (May 1978), 199-229.
18. Miller, R.E., and Snyder, L. Multiple access to B-trees. Proc. Conf. Information and Systems, Johns Hopkins Univ., Baltimore, Md., March 1978, preliminary version.
19. Owicki, S. Axiomatic proof techniques for parallel program. Ph.D. Dissertation, Dep. Computer Science, Cornell Univ., Ithaca, N.Y., 1975.
20. Ries, D.R., and Stonebreaker, M. Effects of locking granularity in a database management system. ACM Trans. Database Syst. 2, 3 (Sept. 1977), 233-246.
21. Samadi, B. B-trees in a system with multiple users. Inf. Process. Lett. 5, 4 (Oct. 1976), 107-112.
22. Swan, R.J., Fuller, S.H., and Siewiorek, D.P. CM*—A modular multi-microprocessor. Proc. AFIPS 1977 NCC, vol. 46, AFIPS Press, Arlington, Va., pp. 637-644.
23. Wedekind, H. On the selection of access paths in a data base system. In Data Base Management, J. W. Kimbie and K. L. Koffeman, Eds. North-Holland, New York, 1974, pp. 385-397.
24. Wulf, W.A., and Bell, C.G. C.mmp—A multi-mini-processor. Proc. AFIPS 1972 FJCC, vol. 41, AFIPS Press, Arlington, Va., pp. 765-777.