Article

Cache-oblivious streaming B-trees

Authors:

Michael A. Bender,

Martin Farach-Colton,

Jeremy T. Fineman,

Yonatan R. Fogel,

Bradley C. Kuszmaul,

Jelani NelsonAuthors Info & Claims

SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures

Pages 81 - 92

https://doi.org/10.1145/1248377.1248393

Published: 09 June 2007 Publication History

Abstract

A streaming B-tree is a dictionary that efficiently implements insertions and range queries. We present two cache-oblivious streaming B-trees, the shuttle tree, and the cache-oblivious lookahead array (COLA).

For block-transfer size B and on N elements, the shuttle tree implements searches in optimal O(log _B+1N) transfers, range queries of L successive elements in optimal O(log _B+1N +L/B) transfers, and insertions in O((log _B+1N)/B^{Θ(1/(log log B)²)}+(log²N)/B) transfers, which is an asymptotic speedup over traditional B-trees if B ≥ (log N)^{1+c log log log² N} for any constant c >1.

A COLA implements searches in O(log N) transfers, range queries in O(log N + L/B) transfers, and insertions in amortized O((log N)/B) transfers, matching the bounds for a (cache-aware) buffered repository tree. A partially deamortized COLA matches these bounds but reduces the worst-case insertion cost to O(log N) if memory size M = Ω(log N). We also present a cache-aware version of the COLA, the lookahead array, which achieves the same bounds as Brodal and Fagerberg's (cache-aware) B^ε-tree.

We compare our COLA implementation to a traditional B-tree. Our COLA implementation runs 790 times faster for random inser-tions, 3.1 times slower for insertions of sorted data, and 3.5 times slower for searches.

References

[1]

A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31(9):1116--1127, Sept. 1988.

Digital Library

[2]

L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority queue and graph algorithm applications. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 268--276, Montréal, Canada, Québec, Canada, May 2002.

Digital Library

[3]

L. Arge and J. S. Vitter. Optimal external memory interval management. SIAM Journal on Computing, 32(6):1488--1508, 2003.

Digital Library

[4]

R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indexes. Acta Inf., 1(3):173--189, Feb. 1972.

Digital Library

[5]

M. A. Bender, R. Cole, E. D. Demaine, and M. Farach-Colton. Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In Proc. 10th Annual European Symp. on Algorithms (ESA), pages 139--151, Rome, Italy, Sept. 2002.

Digital Library

[6]

M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. SIAM J. Comput., 35(2):341--358, 2005. An earlier version of this paper appeared in Proc. 41st Annual Symp. on Foundations of Computer Science (FOCS), pages 399--409, Redondo Beach, California, 2000.

Digital Library

[7]

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms, 3(2):115--136, 2004.

Digital Library

[8]

M. A. Bender, M. Farach-Colton, and B. Kuszmaul. Cache-oblivious string B-trees. In Proc. 25th Symposium on Principles of Database Systems (PODS), pages 233--242, Chicago, Illinois, June 2006.

Digital Library

[9]

J. L. Bentley and J. B. Saxe. Decomposable searching problems i: Static-to-dynamic transformation. J. Algorithms, 1(4):301--358, 1980.

[10]

G. S. Brodal and R. Fagerberg. Lower bounds for external memory dictionaries. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 546--554, Baltimore, Maryland, May 2003.

Digital Library

[11]

G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 39--48, San Francisco, California, Jan. 2002.

Digital Library

[12]

A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 859--860, San Francisco, California, Jan. 2000.

Digital Library

[13]

B. Chazelle and L. J. Guibas. Fractional cascading: I. a data structuring technique. Algorithmica, 1(2):133--162, 1986.

Digital Library

[14]

D. Comer. The ubiquitous B-tree. ACM Comput. Surv., 11(2):121--137, June 1979.

Digital Library

[15]

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th Annual Symp. on Foundations of Computer Science (FOCS), pages 285--297, New York, New York, Oct. 1999.

Digital Library

[16]

I. Katriel. Implicit data structures based on local reorganizations. Master's thesis, Technion, Israel Inst. of Tech., Haifa, May 2002.

[17]

D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, 1973.

[18]

J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 367--375, Orlando, Florida, January 1992.

Digital Library

[19]

M. H. Overmars. The Design of Dynamic Data Structures. Springer, 1983.

Digital Library

[20]

H. Prokop. Cache-oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Inst. of Tech., June 1999.

[21]

Sleepycat Software. The Berkeley Database. http://www.sleepycat.com, 2005.

Cited By

Mathieu CRajaraman RYoung NYousefi A(2024)Competitive Data-Structure DynamizationACM Transactions on Algorithms10.1145/367261420:4(1-28)Online publication date: 28-Jun-2024
https://dl.acm.org/doi/10.1145/3672614
Bender MFarach-Colton MGoodrich MKomlós H(2024)History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data StructuresProceedings of the ACM on Management of Data10.1145/36516092:2(1-27)Online publication date: 14-May-2024
https://doi.org/10.1145/3651609
Gai SXie X(2023)SRockDB: A Range-Query Optimized Database Based on RocksDB2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC53992.2023.10394667(2220-2225)Online publication date: 1-Oct-2023
https://doi.org/10.1109/SMC53992.2023.10394667
Show More Cited By

Index Terms

Cache-oblivious streaming B-trees

Recommendations

The Cost of Cache-Oblivious Searching

This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than lg elog _B N memory transfers between any two levels of the memory ...
Cache-Oblivious B-Trees

This paper presents two dynamic search trees attaining near-optimal performance on any hierarchical memory. The data structures are independent of the parameters of the memory hierarchy, e.g., the number of memory levels, the block-transfer size at each ...
Cache-oblivious B-trees
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the number of memory levels, the block sizes and number of blocks at each ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures

June 2007

376 pages

ISBN:9781595936677

DOI:10.1145/1248377

General Chair:
Phillip B. Gibbons
Intel Research, USA
,
Program Chair:
Christian Scheideler
Technische Universität München, Germany

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA07

Sponsor:

SPAA07: 19th ACM Symposium on Parallelism in Algorithms and Architectures

June 9 - 11, 2007

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

96
Total Citations
View Citations
1,198
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mathieu CRajaraman RYoung NYousefi A(2024)Competitive Data-Structure DynamizationACM Transactions on Algorithms10.1145/367261420:4(1-28)Online publication date: 28-Jun-2024
https://dl.acm.org/doi/10.1145/3672614
Bender MFarach-Colton MGoodrich MKomlós H(2024)History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data StructuresProceedings of the ACM on Management of Data10.1145/36516092:2(1-27)Online publication date: 14-May-2024
https://doi.org/10.1145/3651609
Gai SXie X(2023)SRockDB: A Range-Query Optimized Database Based on RocksDB2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC53992.2023.10394667(2220-2225)Online publication date: 1-Oct-2023
https://doi.org/10.1109/SMC53992.2023.10394667
Menon PQadah TRabl TSadoghi MJacobsen H(2022)LogStore: A Workload-Aware, Adaptable Key-Value Store on Hybrid Storage SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.302719134:8(3867-3882)Online publication date: 1-Aug-2022
https://doi.org/10.1109/TKDE.2020.3027191
Vorobyeva JDelayo DBender MFarach-Colton MPandey PPhillips CSingh SThomas EKroeger T(2022)Using advanced data structures to enable responsive security monitoringCluster Computing10.1007/s10586-021-03463-525:4(2893-2914)Online publication date: 24-Jan-2022
https://doi.org/10.1007/s10586-021-03463-5
Mathieu CRajaraman RYoung NYousefi AMarx D(2021)Competitive data-structure dynamizationProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458199(2269-2287)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458199
Singh SPandey PBender MBerry JFarach-Colton MJohnson RKroeger TPhillips C(2021)Timely Reporting of Heavy Hitters Using External MemoryACM Transactions on Database Systems10.1145/347239246:4(1-35)Online publication date: 15-Nov-2021
https://dl.acm.org/doi/10.1145/3472392
Bender MConway AFarach-Colton MJannen WJiao YJohnson RKnorr EMcallister SMukherjee NPandey PPorter DYuan JZhan Y(2021)External-memory Dictionaries in the Affine and PDAM ModelsACM Transactions on Parallel Computing10.1145/34706358:3(1-20)Online publication date: 20-Sep-2021
https://dl.acm.org/doi/10.1145/3470635
Zhan YConway AJiao YMukherjee NGroombridge IBender MFarach-Colton MJannen WJohnson RPorter DYuan J(2021)Copy-on-Abundant-Write for Nimble File System ClonesACM Transactions on Storage10.1145/342349517:1(1-27)Online publication date: 29-Jan-2021
https://dl.acm.org/doi/10.1145/3423495
Santry DBadam AChidambaram V(2020)Neural TreesProceedings of the 12th USENIX Conference on Hot Topics in Storage and File Systems10.5555/3488733.3488750(17-17)Online publication date: 13-Jul-2020
https://dl.acm.org/doi/10.5555/3488733.3488750
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents