1

[BM72] Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189 (1972).

2

[BS77] Rudolf Bayer, Mario Schkolnick: Concurrency of Operations on B-Trees. Acta Inf. 9: 1-21(1977).

3

William Boswell , Alan L. Tharp, Alternatives to the B++-tree, Proceedings of the international conference on Advances in computing and information, p.266-274, February 1991, Niagara Falls, Canada

4

Rudolf Bayer , Karl Unterauer, Prefix B-trees, ACM Transactions on Database Systems (TODS), v.2 n.1, p.11-26, March 1977  [doi>10.1145/320521.320530]

5

[CLR90] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8,0-07-013143-0.

6

Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979  [doi>10.1145/356770.356776]

7

Edsger W. Dijkstra, The structure of the “THE”-multiprogramming system, Communications of the ACM, v.11 n.5, p.341-346, May 1968  [doi>10.1145/363095.363143]

8

[Ell80] Carla Schlatter Ellis: Concurrent Search and Insertion in 2-3 Trees. Acta Inf. 14: 63-86,(1980).

9

[GS78] Leonidas J. Guibas, Robert Sedgewick: A Dichromatic Framework for Balanced Trees. FOCS 1978: 8-21.

10

[Knu73] Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X.

11

Henry F. Korth , Abraham Silberschatz, Database system concepts, McGraw-Hill, Inc., New York, NY, 1986

12

Yat-Sang Kwong , Derick Wood, Concurrent Operations in Large Ordered Indexes, Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming, p.207-222, April 22-24, 1980

13

Yat-Sang Kwong , Derick Wood, Approaches to Concurrency in B-Trees, Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science, p.402-413, September 01-05, 1980

14

[KW82] Yat-Sang Kwong, Derick Wood: A New Method for Concurrency in B-Trees. IEEE Trans. Software Eng. 8(3): 211-222(1982).

15

Arthur M. Keller , Gio Wiederhold, Concurrent use of B-trees with variable-length entries, ACM SIGMOD Record, v.17 n.2, p.89-90, June 1988  [doi>10.1145/51708.51714]

16

Leslie Lamport, Concurrent reading and writing, Communications of the ACM, v.20 n.11, p.806-811, Nov. 1977  [doi>10.1145/359863.359878]

17

Philip L. Lehman , s. Bing Yao, Efficient locking for concurrent operations on B-trees, ACM Transactions on Database Systems (TODS), v.6 n.4, p.650-670, Dec. 1981  [doi>10.1145/319628.319663]

18

[MPRS79] Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder: Optimal 2, 3-Trees. SIAM J. Comput. 8(1): 42-59(1979).

19

[MR85] Yehudit Mond, Yoav Raz: Concurrency Control in B+-Trees Databases Using Preparatory Operations. VLDB 1985: 331-334.

20

[MS78] E.R. Miller and L. Snyder. Multiple access to B-trees. In Proc. Conference Information Sciences and Systems, pages 400- 407, John Hopkins University - Baltimore, March 1978.

21

[Nag90] S. Nagayama. Decision tables and the implementation of the I-M-E generator (in Portuguese). Master's thesis, Institute of Mathematics and Statistics, USP, São Paulo, 1990.

22

[Par77] J.R. Parr. An access method for concurrently sharing a B-tree index. Technical Report 36, University of Western Ontario, Departament of Computer Science, April 1977.

23

[PHH71] S.L. Pollack, H.J. Hicks, and W.J. Harrison. Decision Tables: Theory and Practice. John Wiley and Sons, New York, 1971.

24

Yehoshua Sagiv, Concurrent operations on B*-trees with overtaking, Journal of Computer and System Sciences, v.33 n.2, p.275-296, Oct. 1986  [doi>10.1016/0022-0000(86)90021-8]

25

[Sam76] Behrokh Samadi: B-Trees in a System with Multiple Users. Inf. Process. Lett. 5(4): 107-112(1976).

26

[SC92] R.M.F. Souza and O.S.F. Carvalho. Concurrency control of B-trees. (in portuguese). IV- Simpósio Brasileiro de Arquitetura de Computadores - Processamento de Alto Desempenho (IV SBAC PAD), pages 397-412, 1992.

27

[Wag73] R.E. Wagner. Indexing design considerations. IBM System Journal, (4):351-367, 1973.

28

[Zis93] A. Zisman. The B-trees and an implementation proposal (in Portuguese). Master's thesis, Institute of Mathematics and Statistics, USP, São Paulo, 1993.

Ibrahim Jaluta , Seppo Sippu , Eljas Soisalon-Soininen, Concurrency control and recovery for balanced B-link trees, The VLDB Journal — The International Journal on Very Large Data Bases, v.14 n.2, p.257-277, April 2005

Jing Dai , Chang-Tien Lu, CLAM: concurrent location management for moving objects, Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems, November 07-09, 2007, Seattle, Washington

V. W. Setzer: colleagues

Andrea Zisman: colleagues