Concurrent search and insertion in 2-3 trees. (English) Zbl 0413.68065


68R99 Discrete mathematics in relation to computer science
68R10 Graph theory (including graph drawing) in computer science
68P20 Information storage and retrieval of data
Full Text: DOI


[1] Aho, A., Hopcroft, J., Ullman, J., The design and analysis of computer algorithms. Reading-London: Addison-Wesley 1974 · Zbl 0326.68005
[2] Bayer, R. and Schkolnick, M., Concurrency of operations on B-trees. Acta Informatica 9, 1-21 (1977) · Zbl 0357.68029
[3] Ellis, C., The design and evaluation of algorithms for parallel processing. TR 79-07-01. Dept. of Computer Science, Univ. of Washington, 1979
[4] Lamport, L., Concurrent reading and writing. CACM 20, 11, 806-811 (1977) · Zbl 0361.68091
[5] Miller, R. and Snyder, L., Multiple access to B-trees. Proc. Conf. Infor. Sci and Syst., preliminary report, March 1978
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.