Meldable heaps and boolean union-find

In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations find-min, insert, delete, decrease-key, and meld. In the usual definition decrease-key and delete get the item and the heap containing it as parameters. We consider the modified problem where decrease-key and delete get only the item but not the heap containing it. We show that for this problem one of the operations find-min, decrease-key, or meld must take non-constant time. This is in contrast with the original data type in which data structures supporting all these three operations in constant time are known (both in an amortized and a worst-case setting).To establish our results for meldable heaps we consider a weaker version of the union-find problem that is of independent interest, which we call Boolean union-find. In the Boolean union-find problem the find operation is a binary predicate that gets an item x and a set A and answers positively if and only if &khgr; ε A. We prove that the lower bounds which hold for union-find in the cell probe model hold for Boolean union-find as well.We also suggest new heap data structures implementing the modified meldable heap data type that are based on redundant binary counters. Our data structures have good worst-case bounds. The best of our data structures matches the worst-case lower bounds which we establish for the problem. The simplest of our data structures is an interesting generalization of binomial queues.

[1]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[2]  Mark R. Brown,et al.  Implementation and Analysis of Binomial Queue Algorithms , 1978, SIAM J. Comput..

[3]  Donald E. Knuth,et al.  A Programming and Problem-Solving Seminar , 1981 .

[4]  Jan van Leeuwen,et al.  Worst-case Analysis of Set Union Algorithms , 1984, JACM.

[5]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[6]  Robert E. Tarjan,et al.  Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation , 1988, CACM.

[7]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[8]  Jeffrey D. Ullman,et al.  A programming and problem solving seminar. , 1991 .

[9]  Gerth Stølting Brodal,et al.  Fast Meldable Priority Queues , 1995, WADS.

[10]  Haim Kaplan,et al.  Purely functional representations of catenable sorted lists , 1996, STOC '96.

[11]  Gerth Stølting Brodal,et al.  Worst-case efficient priority queues , 1996, SODA '96.

[12]  Stephen Alstrup,et al.  Marked ancestor problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  Stephen Alstrup,et al.  Worst-case and amortised optimality in union-find (extended abstract) , 1999, STOC '99.

[14]  Zvi Galil,et al.  A Generalization of a Lower Bound Technique due to Fredman and Saks , 2001, Algorithmica.

[15]  Haim Kaplan,et al.  Union-find with deletions , 2002, SODA '02.

[16]  Haim Kaplan.  Union--nd with Deletions , 2002 .