Contents

Radix heap

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (September 2017) (Learn how and when to remove this message)

This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this articlebyintroducing citations to additional sources. Find sources: "Radix heap" – news · newspapers · books · scholar · JSTOR (May 2024)

Aradix heap is a data structure for realizing the operations of a monotone priority queue. A set of elements to which a key is assigned can then be managed. The run time of the operations depends on the difference between the largest and smallest key or constant. The data structure consists mainly of a series of buckets, the size of which increases exponentially.

1. all keys are natural numbers;
2. max. key - min. key ${\displaystyle \leq }$ C for constant C;
3. the extract-min operation is monotonic; that is, the values returned by successive extract-min calls are monotonically increasing.

The three most important fields are:

1. ${\displaystyle b}$ of size ${\displaystyle B:=\lfloor log(C+1)\rfloor +1}$, with 0 as the lowest index, stores the buckets;
2. ${\displaystyle u}$ of size ${\displaystyle B+1}$, with 0 as the lowest index, store the (lower) bounds of the buckets;
3. ${\displaystyle bNum}$, holds for each element ${\displaystyle x}$ in the heap the bucket in which it is stored.

The above diagram shows the data structure. The following invariants apply:

1. ${\displaystyle u[$i]\leq } key in ${\displaystyle b[$i]<u[i+1]} : the keys in ${\displaystyle b[$i]} are up or down through the value in ${\displaystyle u[i+1]}$or${\displaystyle u[$i]} limited.
2. ${\displaystyle u[0]=0,u[$1]=u[0]+1,u[B]=\infty } and ${\displaystyle 0\leq u[i+1]-u[$i]\leq 2^{i-1}} for ${\displaystyle i=1,\ldots ,B-1}$: the sizes of the buckets increase exponentially.

It is important to note the exponential growth of the limits (and thus the range that a bucket holds). In this way the logarithmic dependence of the field quantities is of value C, the maximum difference between two key values.

During initialization, empty buckets are generated and the lower bounds ${\displaystyle u}$ are generated (according to invariant 2); running time ${\displaystyle O($B)} .

During insert, a new element ${\displaystyle x}$ is linearly moved from right to left through the buckets and the new element with ${\displaystyle k($x)} is stored in the left bucket to that ${\displaystyle u[$i]\geq k(x)} ; running time ${\displaystyle O($B)} .

For decrease-key, first the key value is decreased (checking for compliance with the invariants). Then, the ${\displaystyle bNum}$ field is used to locate the element and it is iterated to the left, if necessary, analogously to the insert operation. The running time is ${\displaystyle O($1)} (amortized).

The extract-min operation removes an element from bucket ${\displaystyle b[0]}$ and returns it. If the bucket ${\displaystyle b[0]}$ is not yet empty, the operation is terminated. If, however, it is empty, the next larger non-empty bucket is searched, its smallest element ${\displaystyle k}$ tracked and ${\displaystyle u[0]}$ is set to k (monotonicity is required for this). Then, according to the invariants, the bucket boundaries are redefined and the elements removed ${\displaystyle b[$i]} to the newly formed buckets; running time ${\displaystyle O($1)} (amortized).

If displayed, the field ${\displaystyle bNum}$ is updated.

• B.V. Cherkassky, A.V. Goldberg, C. Silverstein: Buckets, Heaps, Lists and Monotone Priority Queues (Abstract), in: Proceedings of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms. January 1997, pp. 83-92.