Shadow heap

In computer science, a shadow heap is a mergeable heap data structure which supports efficient heap merging in the amortized sense. More specifically, shadow heaps make use of the shadow merge algorithm to achieve insertion in O(f(n)) amortized time and deletion in O((log n log log n)/f(n)) amortized time, for any choice of 1 ≤ f(n) ≤ log log n. ^[1]

Throughout this article, it is assumed that A and B are binary heaps with |A| ≤ |B|.

Shadow merge

Shadow merge is an algorithm for merging two binary heaps efficiently if these heaps are implemented as arrays. Specifically, the running time of shadow merge on two heaps ${\displaystyle A}$ and ${\displaystyle B}$ is ${\displaystyle O(|A|+\min\{\log |B|\log \log |B|,\log |A|\log |B|\})}$.

Algorithm

We wish to merge the two binary min-heaps ${\displaystyle A}$ and ${\displaystyle B}$. The algorithm is as follows:

1. Concatenate the array ${\displaystyle A}$ at the end of the array ${\displaystyle B}$ to obtain an array ${\displaystyle C}$.
2. Identify the shadow of ${\displaystyle A}$ in ${\displaystyle C}$; that is, the ancestors of the last ${\displaystyle |A|}$ nodes in ${\displaystyle C}$ which destroy the heap property.
3. Identify the following two parts of the shadow from ${\displaystyle C}$:
   • The path${\displaystyle P}$: the set of nodes in the shadow for which there are at most 2 at any depth of ${\displaystyle C}$;
   • The subtree${\displaystyle T}$: the remainder of the shadow.
4. Extract and sort the smallest ${\displaystyle |P|}$ nodes from the shadow into an array ${\displaystyle S}$.
5. Transform ${\displaystyle S}$ as follows:
   • If ${\displaystyle |S|>|C|}$, then starting from the smallest element in the sorted array, sequentially insert each element of ${\displaystyle S}$ into ${\displaystyle C}$, replacing them with ${\displaystyle C}$'s smallest elements.
   • If ${\displaystyle |S|\leq |C|}$, then extract and sort the ${\displaystyle |P|}$ smallest elements from ${\displaystyle C}$, and merge this sorted list with ${\displaystyle S}$.
6. Replace the elements of ${\displaystyle S}$ into their original positions in ${\displaystyle C}$.
7. Make a heap out of ${\displaystyle T}$.

Running time

Again, let ${\displaystyle P}$ denote the path, and ${\displaystyle T}$ denote the subtree of the concatenated heap ${\displaystyle C}$. The number of nodes in ${\displaystyle P}$ is at most twice the depth of ${\displaystyle C}$, which is ${\displaystyle O(\log |B|)}$. Moreover, the number of nodes in ${\displaystyle T}$ at depth ${\displaystyle d}$ is at most 3/4 the number of nodes at depth ${\displaystyle d+1}$, so the subtree has size ${\displaystyle O(|A|)}$. Since there are at most 2 nodes at each level on ${\displaystyle P}$, then reading the smallest ${\displaystyle |P|}$ elements of the shadow into the sorted array ${\displaystyle S}$ takes ${\displaystyle O(\log |B|)}$ time.

If ${\displaystyle |S|>|C|}$, then combining ${\displaystyle P}$ and ${\displaystyle C}$ as in step 5 above takes time ${\displaystyle O(\log |A|\log |B|)}$. Otherwise, the time taken in this step is ${\displaystyle O(|A|+\log |B|\log \log |B|)}$. Finally, making a heap of the subtree ${\displaystyle T}$ takes ${\displaystyle O(|A|)}$ time. This amounts to a total running time for shadow merging of ${\displaystyle O(|A|+\min\{\log |A|\log |B|,\log |B|\log \log |B|\})}$.

Structure

A shadow heap ${\displaystyle H}$ consists of threshold function ${\displaystyle f(H)}$, and an array for which the usual array-implemented binary heap property is upheld in its first entries, and for which the heap property is not necessarily upheld in the other entries. Thus, the shadow heap is essentially a binary heap ${\displaystyle B}$ adjacent to an array ${\displaystyle A}$. To add an element to the shadow heap, place it in the array ${\displaystyle A}$. If the array becomes too large according to the specified threshold, we first build a heap out of ${\displaystyle A}$ using Floyd's algorithm for heap construction, ^[2] and then merge this heap with ${\displaystyle B}$ using shadow merge. Finally, the merging of shadow heaps is simply done through sequential insertion of one heap into the other using the above insertion procedure.

Analysis

We are given a shadow heap ${\displaystyle H=(B,A)}$, with threshold function ${\displaystyle \log |H|\leq f(H)\leq \log |H|\log \log |H|}$ as above. Suppose that the threshold function is such that any change in ${\displaystyle |B|}$ induces no larger a change than in ${\displaystyle f(H)}$. We derive the desired running time bounds for the mergeable heap operations using the potential method for amortized analysis. The potential ${\displaystyle \Psi (H)}$ of the heap is chosen to be:

${\displaystyle \Psi (H)=|A|(1+\min\{\log |B|\log \log |B|,\log |B|\log |A|\}/f(H))}$

Using this potential, we can obtain the desired amortized running times:

create(H): initializes a new empty shadow heap ${\displaystyle H}$

Here, the potential ${\displaystyle \Psi }$ is unchanged, so the amortized cost of creation is ${\displaystyle O(1)}$, the actual cost.

insert(x, H): inserts ${\displaystyle x}$ into the shadow heap ${\displaystyle H}$

There are two cases:

• If the merge is employed, then the drop in the potential function is exactly the actual cost of merging ${\displaystyle B}$ and ${\displaystyle A}$, so the amortized cost is ${\displaystyle O(1)}$.
• If the merge is not done, then the amortized cost is ${\displaystyle O(1+\min\{\log |B|\log \log |B|,\log |B|\log |A|\}/f(H))}$

By choice of the threshold function, we thus obtain that the amortized cost of insertion is:

${\displaystyle O(\log |H|\log \log |H|/f(H))}$

delete_min(H): deletes the minimum priority element from ${\displaystyle H}$

Finding and deleting the minimum takes actual time ${\displaystyle O(|A|+\log |B|)}$. Moreover, the potential function can only increase after this deletion if the value of ${\displaystyle f(H)}$ decreases. By choice of ${\displaystyle f}$, we have that the amortized cost of this operation is the same as the actual cost.

Related algorithms & data structures

A naive binary heap merging algorithm will merge the two heaps ${\displaystyle A}$ and ${\displaystyle B}$ in time ${\displaystyle O(|B|)}$ by simply concatenating both heaps and making a heap out of the resulting array using Floyd's algorithm for heap construction. Alternatively, the heaps can simply be merged by sequentially inserting each element of ${\displaystyle A}$ into ${\displaystyle B}$, taking time ${\displaystyle O(|A|\log |B|)}$.

Sack and Strothotte proposed an algorithm for merging the binary heaps in ${\displaystyle O(|A|+\log |A|\log |B|)}$ time. ^[3] Their algorithm is known to be more efficient than the second naive solution described above roughly when ${\displaystyle |A|>\log |B|}$. Shadow merge performs asymptotically better than their algorithm, even in the worst case.

There are several other heaps which support faster merge times. For instance, Fibonacci heaps can be merged in ${\displaystyle O(1)}$ time. Since binary heaps require ${\displaystyle \Omega (|A|)}$ time to merge, ^[4] shadow merge remains efficient.

References

1. Kuszmaul, Christopher L. (2000). Efficient Merge and Insert Operations for Binary Heaps and Trees (PDF) (Technical report). NASA Advanced Supercomputing Division. 00-003. 
2. Suchenek, Marek A. (2012), "Elementary Yet Precise Worst-Case Analysis of Floyd's Heap-Construction Program", Fundamenta Informaticae, IOS Press, 120 (1): 75–92, doi:10.3233/FI-2012-751  
3. Sack, Jörg-R.; Strothotte, Thomas (1985), "An Algorithm for Merging Heaps", Acta Informatica, Springer-Verlag, 22 (2): 171–186, doi:10.1007/BF00264229  .
4. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (1990). Introduction to Algorithms (1st ed.). MIT Press and McGraw-Hill. ISBN   0-262-03141-8.