This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2013 IEEE 29th International Conference on Data Engineering (ICDE)
The Bw-Tree: A B-tree for new hardware platforms
Brisbane, Australia Australia
April 08-April 12
ISBN: 978-1-4673-4909-3
Justin J. Levandoski, Microsoft Research Redmond, WA 98052, USA
David B. Lomet, Microsoft Research Redmond, WA 98052, USA
Sudipta Sengupta, Microsoft Research Redmond, WA 98052, USA
The emergence of new hardware and platforms has led to reconsideration of how data management systems are designed. However, certain basic functions such as key indexed access to records remain essential. While we exploit the common architectural layering of prior systems, we make radically new design decisions about each layer. Our new form of B-tree, called the Bw-tree achieves its very high performance via a latch-free approach that effectively exploits the processor caches of modern multi-core chips. Our storage manager uses a unique form of log structuring that blurs the distinction between a page and a record store and works well with flash storage. This paper describes the architecture and algorithms for the Bw-tree, focusing on the main memory aspects. The paper includes results of our experiments that demonstrate that this fresh approach produces outstanding performance.
Citation:
Justin J. Levandoski, David B. Lomet, Sudipta Sengupta, "The Bw-Tree: A B-tree for new hardware platforms," icde, pp.302-313, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013
Usage of this product signifies your acceptance of the Terms of Use.