Efficient Locking for Concurrent Operations on B-Trees PHILIP L. LEHMAN Carnegie-Mellon University and S. BING YAO

First Page		Document Content
Date: 2005-12-11 14:10:45 Data structures Data management B-tree R-tree Binary search tree Linked list Tree Search tree Ternary tree Graph theory Computing Binary trees		Efficient Locking for Concurrent Operations on B-Trees PHILIP L. LEHMAN Carnegie-Mellon University and S. BING YAO Add to Reading List Source URL: www.csd.uoc.gr Download Document from Source Website File Size: 1,34 MB Share Document on Facebook

	Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada DocID: 1uCBo - View Document
	Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 DocID: 1qXBI - View Document
	Algorithms and Data Structures (WS15/16) Exercises for Units 14 and 15 Problem 1 Try to get some feel for the behavior of the splay tree data structure. Draw a binary search tree with 5-10 nodes, and work out a few splay DocID: 1qNaY - View Document
	Historical index structure for reducing insertion and search cost in LBS DocID: 1qEgC - View Document
	Fast Concurrent AVL Trees Erik Henriksson December 16th, 2013 Fast Concurrent AVL Trees DocID: 1qsSy - View Document