y
Download:
|
|
by Yossi Matias, Suleyman Cenk S Ahinalp, Neal E. Young
http://www.dcs.warwick.ac.uk/people/academic/Cenk.Sahinalp/Papers/priority.queues.ps
Add To MetaCart
Abstract:
We report on implementation and a modest experimental evaluation of a recently introduced priority-queue data structure. The new data structure is designed to take advantage of fast operations on machine words and, as appropriate, reduced key-universe size and/or tolerance of approximate answers to queries. In addition to standard priority-queue operations, the data structure also supports successor and predecessor queries. Our results suggest that the data structure is practical and can be faster than traditional priority queues when holding a large number of keys, and that tolerance for approximate answers can lead to significant increases in speed.
Citations
| 2004 | The Design and Analysis of Computer Algorithms – Aho, Hopcroft, et al. - 1974 |
| 133 | Design and implementation of an efficient priority queue – Boas, Kaas, et al. - 1977 |
| 131 | Trans-dichotomous algorithms for minimum spanning trees and shortest paths – Fredman, Willard - 1994 |
| 65 | The influence of caches on the performance of heaps – LaMarca, Ladner - 1996 |
| 25 | Pairing heaps: experiments and analysis – STASKO, VITTER - 1987 |
| 20 | Blasting through the information theoretic barrier with fusion trees – Fredman, Willard - 1990 |
| 20 | Applications of the fusion tree method to computational geometry and searching – Willard - 1992 |
| 15 | An empirical comparison of priority queue and event set implementations – Jones - 1986 |
| 15 | Approximate data structures with applications – Matias, Vitter, et al. - 1994 |
| 12 | Data Structures and Algorithms I: Sorting and Searching – Mehlhorn - 1984 |
| 1 | system manual, version 3.2.3 – LEDA |
