Building a Bw-Tree Takes More Than Just Buzz Words
Authors:
Open Access
- 27 May 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 473-488
Abstract
No abstract availableKeywords
Funding Information
- Intel Science and Technology Center for Visual Cloud Systems (N/A)
- U.S. National Science Foundation (CCF-1438955, CCF-1535821)
This publication has 30 references indexed in Scilit:
- FOEDUS2015
- A comparison of adaptive radix trees and hash tables2015
- Scaling HTM-Supported Database Transactions to Many CoresIEEE Transactions on Knowledge and Data Engineering, 2015
- LLAMAProceedings of the VLDB Endowment, 2013
- A Practical Multi-word Compare-and-Swap Operation2002
- The evolution of effective B-treeACM SIGMOD Record, 2001
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Concurrency of operations on B-treesActa Informatica, 1977