Abstract
A new data structure called ordered priority queue is introduced in this paper. Elements stored in the data structure have a primary order (key) and a secondary order (priority) associated with them. An ordered min-priority queue allows users to find the minimum priority element in any range (according to key order) inO(logn) time. Such a data structure withn elements can be created inO(n logn) time usingO(n) storage. A specific implementation based on median split trees is presented. Sequential access of the elements can be done inO(n log logn) time andO(logn) extra storage.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. D. Atkinson, J.-R. Sack, N. Santoro and Th. Strothotte,An efficient, implicit double-ended priority queue, Carleton University Technical Report SCS-TR-55, 1984.
D. E. Knuth,The Art of Computer Programming, Vol. 3, Addison-Wesley, 1973.
S.-H. S. Huang and C. K. Wong,Optimal binary split trees, J. Algorithms, 5, 69–79, 1984.
J. H. Hester, D. S. Hirschberg, S.-H. S. Huang and C. K. Wong,Faster construction of optimal binary split trees, to appear in J. of Algorithms.
E. M. Reingold, J. Nievergelt and N. Deo,Combinatorial Algorithms, Prentice-Hall, 1977.
B. A. Sheil,Median split trees: A fast lookup technique for frequently occurring keys, Comm. ACM 21, 947–958, 1978.
J. W. J. Williams,Algorithm 232, Comm. ACM, 7, 347–348, 1964.
Author information
Authors and Affiliations
Additional information
This work was supported in part by NASA under grant NAG 5-739.
Rights and permissions
About this article
Cite this article
Huang, SH.S. Ordered priority queues. BIT 26, 442–450 (1986). https://doi.org/10.1007/BF01935051
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01935051