Back to Results
First PageMeta Content
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

Document Date: 2009-04-07 15:02:30

Open Document

File Size: 1,34 MB

Share Result on Facebook

Company

Schkoinick / Bayer / Lehman / /

Currency

USD / /

Facility

College of Business / Carnegie-Mellon University / University of Maryland / College Park / B-Trees PHILIP L. LEHMAN Carnegie-Mellon University / /

IndustryTerm

database applications / secondary storage device / concurrent binary search trees / search key / insertion algorithms / search process / concurrent algorithms / procedure search / earlier solutions / multiway search / secondary storage devices / search time / concurrency solution / precise search / /

Organization

B-Trees PHILIP L. LEHMAN Carnegie-Mellon University / College of Business and Management / Carnegie-Mellon University / Pittsburgh / University of Maryland / College Park / National Science Foundation / Department of Computer Science / Purdue University / Association for Computing Machinery / /

Person

S. BING YAO / /

ProvinceOrState

Maryland / Pennsylvania / /

Technology

following algorithm / insertion algorithms / 4.1 Algorithm / /

SocialTag