Expulsive tree data structures for fast data search by a key

We intend to draw a comparison between the different most known data indexing structures so as to outline the bottlenecks and faults from the point of view of their utilization in the fine grained algorithms simulating system WinALT. Then we would like to propose some ways to eliminate these drawbacks and to give a description of a tree structure with both satisfactory memory consumption and acceptable access time for the considered type of simulating systems. The proposed data structure is called expulsive tree.