Exponential tree

Exponential tree
Type	tree
Invented	1995
Invented by	Arne Andersson
Time complexity in big O notation Operation Average Worst case Search O(min(√log n, log n/log w+ log log n, log w log log n)) O(min(√log n, log n/log w+ log log n, log w log log n)) Insert O(min(√log n, log n/log w+ log log n, log w log log n)) O(min(√log n, log n/log w+ log log n, log w log log n)) Delete O(min(√log n, log n/log w+ log log n, log w log log n)) O(min(√log n, log n/log w+ log log n, log w log log n)) Space complexity Space O(n) O(n)

An exponential tree is a type of search tree where the number of children of its nodes decreases doubly-exponentially with increasing depth. Values are stored only in the leaf nodes. Each node contains a splitter, a value less than or equal to all values in the subtree which is used during search. Exponential trees use another data structure in inner nodes containing the splitters from children, allowing fast lookup.

Exponential trees achieve optimal asymptotic complexity on some operations. They have mainly theoretical importance.

Tree structure

An exponential tree is a rooted tree where every node contains a splitter and every leaf node contains a value. The value may be different from the splitter. An exponential tree with ${\displaystyle n}$ values is defined recursively:

• The root has ${\displaystyle \Theta (n^{1/k})}$ children
• The splitter of the root is the same as the splitter of the leftmost child
• The splitters of all children are stored in a local data structure
• The subtrees are exponential trees with ${\displaystyle \Theta (n^{1-1/k})}$ values

An additional condition is that searching for a value using the splitters must yield the correct node (i.e. the one containing the value). Therefore, if a root of a subtree contains the splitter ${\displaystyle s}$ and its right sibling contains the splitter ${\displaystyle s'}$, then this subtree can only contain keys in the range ${\displaystyle [s,s')}$.

Local data structure

The tree uses a static data structure in every inner node to allow fast lookup of values. It must be possible to build this structure with ${\displaystyle d}$ values in time ${\displaystyle O(d^{k-1})}$. The lookup time in this structure is denoted ${\displaystyle S(d)}$.

A Fusion tree can be used as this data structure.

Operations

Search

The exponential tree can be searched in the same way as a normal search tree. In each node, the local data structure can be used to find the next child quickly.

Let ${\displaystyle T(n)}$ denote the time complexity of the search. Then it satisfies the following recurrence:

${\displaystyle T(n)\leq T(n^{1-1/k})+O(S(n))}$

Insert

Delete

References

• Andersson, Arne (October 1996). "Faster deterministic sorting and searching in linear space". Proceedings of 37th Conference on Foundations of Computer Science. pp. 135–141. doi:10.1109/SFCS.1996.548472. ISBN 0-8186-7594-2. S2CID 13603426.
• Andersson, Arne; Thorup, Mikkel (2007-06-01). "Dynamic ordered sets with exponential search trees". Journal of the ACM. 54 (3): 13–es. arXiv:cs/0210006. doi:10.1145/1236457.1236460. ISSN 0004-5411. S2CID 8175703.