前言
WaterfallTree（瀑布樹） 是最強純C#開源NoSQL和虛擬文件系統-STSdb專有的（版權所有/專利）算法/存儲結構。
參考
關於STSdb，我之前寫過幾篇文章，譬如：
技術分析
STSdb其中一個最重要的部分是WaterfallTree(瀑布樹)這個新發現的存儲結構。
詳細的官方原文，可以在這里找到：WaterfallTree™ The Technology。
搬運
鑒於有同學說無法訪問官方網站，我在這里搬運一下英文原版，等有空的時候再翻譯成中文
應用技術
W-tree is a natural generalization of B+-tree. Operations in B+-tree are executed synchronously (one by one), while in W-tree, operations are executed asynchronously (in groups). When an operation enters B+-tree it "sinks" up to its respective leaf. When an operation enters W-tree it „stops” in the first node which is not overloaded.Operations in W-tree accumulate in its internal nodes. When a certain internal node overloads with operations, the branch with the greatest number of operations adjacent to it is selected and they are „poured down“ the tree. The W-tree data structure solves the problem of speed degradation when indexing records with random keys.
One head move a lot of work done.
組織結構
維持
詳細例子
分析
B+tree vs Waterfall Tree
