Abstract
We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (the mode). We are interested in minimizing the cache complexity (or number of cache misses) of algorithms for these problems in the context under which cache size and block size are unknown. We give algorithms with cache complexities within a constant factor of the optimal for all the problems. In the case of determining the mode, the optimal algorithm is randomized as the deterministic algorithm differs from the lower bound by a sublogarithmic factor. We can achieve optimality either with a randomized method or if given, along with the input, lg lg of relative frequency of the mode with a constant additive error.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, A., Vitter, J.S.: The I/O complexity of sorting and related problems. In: ICALP 1987. LNCS, vol. 267, pp. 467–478. Springer, Heidelberg (1987)
Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: FOCS Proceedings, pp. 285–297. IEEE Computer Society Press, Los Alamitos (1999)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
Munro, I., Spira, P.: Sorting and searching in multisets. SIAM Journal on Computing 5, 1–8 (1976)
Arge, L., Knudsen, M., Larsen, K.: A general lower bound on the I/O-complexity of comparison-based algorithms. In: Proceedings of WADS. Springer, Heidelberg (1993)
Brodal, F.: Cache oblivious distribution sweeping. In: Widmayer, P., et al. (eds.) ICALP 2002. LNCS, vol. 2380, p. 426. Springer, Heidelberg (2002)
Demaine, E.D.: Cache-oblivious algorithms and data structures. In: Lecture Notes from the EEF Summer School on Massive Data Sets, BRICS, University of Aarhus, Denmark. LNCS. Springer, Heidelberg (2002)
Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. In: IEEE (eds.) Annual Symposium on Foundations of Computer Science 2000, pp. 399–409. IEEE Computer Society Press, Los Alamitos (2000)
Misra, J., Gries, D.: Finding repeated elements. Science of Computer Programming 2, 143–152 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farzan, A., Ferragina, P., Franceschini, G., Munro, J.I. (2005). Cache-Oblivious Comparison-Based Algorithms on Multisets. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_29
Download citation
DOI: https://doi.org/10.1007/11561071_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)