Simple, Robust and Highly Concurrent B-trees with Node Deletion David B. Lomet   View Paper (PDF)   Return to Research Session 1: Indexing I ©2005 Association for Computing Machinery