Fusion Trees. Advanced Data Structures Aris Tentes. Goal. Fixed Universe Successor Problem We have a set of n numbers Each number has a length of at most log u bits (u=size of the fixed Universe) We want to perform the following actions: Predecessor/Successor Insertion/Deletion
Advanced Data Structures
Fixed Universe Successor Problem
in time better than O(log n)
A fusion tree is a B-tree with fan-out and, therefore, has a height of
If we find a way to determine, where a query fits among the B keys of a node in constant time, then we have an solution to our problem
which is long.
msb(x) desired rank.
First Phase desired rank.