Simple, Robust and Highly Concurrent B-trees with Node Deletion - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

David B. Lomet. Simple, Robust and Highly Concurrent B-trees with Node Deletion. In Proceedings of the 20th International Conference on Data Engineering, ICDE 2004, 30 March - 2 April 2004, Boston, MA, USA. pages 18-28, IEEE Computer Society, 2004. [doi]

This author has not been identified. Look up 'David B. Lomet' in Google

runs on WebDSL