Abstract
We consider the dynamic version of the online multiselection problem for internal and external memory, in which q selection queries are requested on an unsorted array of N elements. Our internal memory result is 1-competitive with the offline result of Kaligosiet al.[ICALP 2005]. In particular, we extend the results of Barbaryet al.[ESA 2013] by supporting arbitrary insertions and deletions while supporting online select and search queries on the array. Assuming that the insertion of an element is immediately preceded by a search for that element, we show that our dynamic online algorithm performs an optimal number of comparisons, up to lower order terms and an additive O(N) term.
For the external memory model, we describe the first online multiselection algorithm that is O(1)-competitive. This result improves upon the work of Sibeyn [Journal of Algorithms 2006] when q > m, where m is the number of blocks that can be stored in main memory. We also extend it to support searches, insertions, and deletions of elements efficiently.
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 input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
Brodal, G., Fagerberg, R.: On the limits of cache-obliviousness. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 307–315 (2003)
Barbay, J., Gupta, A., Jo, S., Rao, S.S., Sorenson, J.: Theory and implementation of online multiselection algorithms. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 109–120. Springer, Heidelberg (2013)
Dobkin, D.P., Ian Munro, J.: Optimal time minimal space selection algorithms. J. ACM 28(3), 454–461 (1981)
Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47(3), 424–436 (1993)
Hoare, C.A.R.: Algorithm 65: find. Commun. ACM 4(7), 321–322 (1961)
Hon, W.-K., Sadakane, K., Sung, W.-K.: Succinct data structures for searchable partial sums. In: Proceedings of the International Symposium on Algorithms and Computation, pp. 505–516 (2003)
Jiménez, R.M., Martínez, C.: Interval Sorting. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 238–249. Springer, Heidelberg (2010)
Kaligosi, K., Mehlhorn, K., Munro, J.I., Sanders, P.: Towards optimal multiple selection. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 103–114. Springer, Heidelberg (2005)
Motwani, R., Raghavan, P.: Deferred data structuring: Query-driven preprocessing for geometric search problems. In: Symposium on Computational Geometry, pp. 303–312 (1986)
Prodinger, H.: Multiple quickselect - Hoare’s find algorithm for several elements. Inf. Process. Lett. 56(3), 123–129 (1995)
Sibeyn, J.F.: External selection. J. Algorithms 58(2), 104–117 (2006)
Ching, Y.-T., Mehlhorn, K., Smid, M.H.M.: Dynamic deferred data structuring. Information Processing Letters 35(1), 37–40 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Barbay, J., Gupta, A., Rao Satti, S., Sorenson, J. (2015). Dynamic Online Multiselection in Internal and External Memory. In: Rahman, M.S., Tomita, E. (eds) WALCOM: Algorithms and Computation. WALCOM 2015. Lecture Notes in Computer Science, vol 8973. Springer, Cham. https://doi.org/10.1007/978-3-319-15612-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-15612-5_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15611-8
Online ISBN: 978-3-319-15612-5
eBook Packages: Computer ScienceComputer Science (R0)