![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Ibrahim Jaluta Ibrahim Jaluta, Seppo Sippu , Eljas Soisalon-Soininen : Concurrency control and recovery for balanced B-link trees. VLDB J. 14 (2): 257-277 (2005) 1 [ 1 ] 2 [ 1 ] ![]() ©2006 Association for Computing Machinery |