http://www.zhihu.com/question/26547156
Tango Tree
Taking advantage of cache locality. 'Preferred path' is a recently access searching path (which is warmed in cache). Another aux tree(RB tree) is built for each preferred path - an (RB-)tree on a preferred(cache-warmed) path in reference(original) tree. O(lglgN). Maintanence: aux tree join\cut.
-------
*Link-cut Tree. for dynamic graph algos. Very similar with Tango tree
*Euler-tour Tree: for dynamic graph algos(mainly on connectivity). Based on Euler paths. Also with link\cut ops.
*Dynamic Graph Algorithms http://www.diku.dk/PATH05/CRC-book1.pdf
Interest on graph delta instead of starting from scratch everytime.
-------
*For Transdichotomous model (http://en.wikipedia.org/wiki/Transdichotomous_model):
van Emde Boas Tree
Fusion Tree
-------
*Temporal data structure
