The soft heap: an approximate priority queue with optimal error rate

A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat the logarithmic bound on the complexity of a heap in a comparison-based model. To break this information-theoretic barrier, the entropy of the data structure is reduced by artificially raising the values of certain keys. Given any mixed sequence of n operations, a soft heap with error rate (for any 0 1/2) ensures that, at any time, at most n of its items have their keys raised. The amortized complexity of each operation is constant, except for insert, which takes O(log 1/ ) time. The soft heap is optimal for any value of in a comparison-based model. The data structure is purely pointer-based. No arrays are used and no numeric assumptions are made on the keys. The main idea behind the soft heap is to move items across the data structure not individually, as is customary, but in groups, in a data-structuring e...

• Type: Journal
• Year: 2000
• Where: JACM
• Authors: Bernard Chazelle
• Keywords: Data Structures, JACM 2000, Priority Queue, Soft Heap