Efficient locking for concurrent operations on B-trees

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Philip L. Lehman Carnegie-Mellon Univ., Pittsburgh, PA
s. Bing Yao
Published in:
· Journal
ACM Transactions on Database Systems (TODS) TODS Homepage archive
Volume 6 Issue 4, Dec. 1981
Pages 650 - 670
ACM New York, NY, USA
table of contents doi>10.1145/319628.319663
Efficient locking for concurrent operations on B-trees Published by ACM 1981 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 30
· Downloads (12 Months): 158
· Downloads (cumulative): 2,409
· Citation Count: 135


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder