Performance guarantees for B-trees with different-sized atomic keys

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Michael A. Bender Stony Brook University, Stony Brook, NY, USA
Haodong Hu Microsoft, Redmond, WA, USA
Bradley C. Kuszmaul MIT, Cambridge, MA, USA
Published in:
Cover Image
 
· Proceeding
PODS '10 Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 305-316
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0033-9 doi>10.1145/1807085.1807125
Performance guarantees for B-trees with different-sized atomic keys Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 109
· Downloads (cumulative): 276
· Citation Count: 0


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