Geek Answers Handbook

What is a bw tree?

I just read an article about "in-memory OLTP" for the next version of SQL Server; he mentions the BW-Tree as being added, as well as hash indexes in CTP2.

So what is a BW-tree? Can anyone explain this without me (and everyone else) to read a 12-page research paper.

+8
algorithm database sql-server data-structures tree
source share
2 answers

From Microsoft:

Our new form of B tree, called the Bw tree, achieves very high performance due to its alkaline-free approach that efficiently uses the processor caches of modern multi-core chips. Our storage manager uses a unique form of log structuring that blurs the distinction between page and record storage and works well with flash memory.

You can read the pdf here

+5
source share

In a nutshell, bw-tree is a kind of b-tree that is optimized for use in memory and for high concurrency. For memory: pages are variable in size and always tightly packed; no partially filled pages. For high-concurrency: the data structure is completely locked and locked to support parallel DML without blocking.

+6
source share

More articles:


All Articles