Abstract
In this paper we investigate the top-k-selection problem, i.e. to determine and sort the top k elements, in the dynamic data model. Here dynamic means that the underlying total order evolves over time, and that the order can only be probed by pair-wise comparisons. It is assumed that at each time step, only one pair of elements can be compared. This assumption of restricted access is reasonable in the dynamic model, especially for massive data set where it is impossible to access all the data before the next change occurs. Previously only two special cases were studiedĀ [1] in this model: selecting the element of a given rank, and sorting all elements. This paper systematically deals with \(k\in [n]\). Specifically, we identify the critical point \(k^*\) such that the top-k-selection problem can be solved error-free with probability \(1-o(1)\) if and only if \(k=o(k^*)\). A lower bound of the error when \(k=\varOmega (k^*)\) is also determined, which actually is tight under some conditions. In contrast, we show that the top-k-set problem, which means finding the top k elements without sorting them, can be solved error-free with probability \(1-o(1)\) for all \(1\le k\le n\). Additionally, we consider some extensions of the dynamic data model and show that most of these results still hold.
The work is partially supported by National Natural Science Foundation of China (61173009, 61170062, 61222202, 61433014, 61502449), State Key Laboratory of Software Development Environment Open Fund (SKLSDE-2014KF-01), and the China National Program for support of Top-notch Young Professionals.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anagnostopoulos, A., Kumar, R., Mahdian, M., Upfal, E.: Sort me if you can: how to sort dynamic data. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 339ā350. Springer, Heidelberg (2009)
Ilyas, I., Beskales, G., Soliman, M.: A survey of top-\(k\) query processing techniques in relational database systems. ACM Comput. Surv. 40(4) (2008). Article 11
Knuth, D.E.: The Art of Computer Programming, vol. 3. Addison-Wesley, Boston (1973)
Kislitsyn, S.S.: On the selection of the \(k\)th element of an ordered set by pairwise comparison. Sibirskii Mat. Zhurnal 5, 557ā564 (1964)
Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448ā461 (1973)
Dor, D., Zwick, U.: Selecting the median. In: SODA 1995, pp. 28ā37 (1995)
Moreland, A.: Dynamic Data: Model, Sorting, Selection. Technical report (2014)
Anagnostopoulos, A., Kumar, R., Mahdian, M., Upfal, E., Vandin, F.: Algorithms on evolving graphs. In: 3rd Innovations in Theoretical Computer Science Conference (ITCS), pp. 149ā160. ACM, New York (2012)
Bahmani, B., Kumar, R., Mahdian, M., Upfal, E.: Pagerank on an evolving graph. In: 18th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 24ā32. ACM (2012)
Zhuang, H., Sun, Y., Tang, J., Zhang J., Sun, X.: Influence maximization in dynamic social networks. In: 13th IEEE International Conference on Data Mining (ICDM), pp. 1313ā1318. IEEE (2013)
Labouseur, A.G., Olsen, P.W., Hwang, J.H.: Scalable and robust management of dynamic graph data. In: 1st International Workshop on Big Dynamic Distributed Data (BD3@VLDB), pp. 43ā48 (2013)
Ren, C.: Algorithms for evolving graph analysis. Doctoral dissertation. The University of Hong Kong (2014)
Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 37ā48. Springer, Heidelberg (2009)
Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5), 1001ā1018 (1994)
Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 1ā16. ACM (2002)
Bressan, M., Peserico, E., Pretto, L.: Approximating PageRank locally with sublinear query complexity. ArXiv preprint (2014). arXiv:1404.1864
Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Mishima, T., Onizuka, M.: Fast and exact top-k algorithm for pagerank. In: 27th AAAI Conference on Artificial Intelligence, pp. 1106ā1112 (2013)
Albers, S.: Online algorithms: a survey. Math. Prog. 97(1ā2), 3ā26 (2003)
Kuleshov, V., Precup, D.: Algorithms for multi-armed bandit problems. ArXiv preprint (2014). arXiv:1402.6028
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, Q., Liu, X., Sun, X., Zhang, J. (2015). How to Select the Top k Elements from Evolving Data?. In: Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science(), vol 9472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48971-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-48971-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48970-3
Online ISBN: 978-3-662-48971-0
eBook Packages: Computer ScienceComputer Science (R0)