Abstract
This paper addresses the efficient processing of distributed top-k monitoring, which is continuously reporting the k largest values according to a user-specified ranking function over distributed data streams. To minimize communication requirements, the necessary data transmitting must be selected carefully. We study the optimization problem of which objects are necessary to be transmitted and present a new distributed top-k monitoring algorithm to reduce communication cost. In our approach, few objects are transmitted for maintaining the top-k set and communication cost is independent of k. We verify the effectiveness of our approach empirically using both real-world and synthetic data sets. We show that our approach reduces overall communication cost by a factor ranging from 2 to over an order of magnitude compared with the previous approach when k is no lees than 10.
This research is partly supported by the National High Technology Research and Development Plan (863 plan) of China under Grants No.2004AA112020 and No.2003AA111020.
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
Arlitt, M., Jin, T.: 1998 world cup web site access logs (August 1998), Available at: http://www.acm.org/sigcomm/ITA/
Bruno, N., Gravano, L., Marian, A.: Evaluating top-k queries over web-accessible databases. In: ICDE 2002 (2002)
Balke, W.-T., Nejdl, W., Siberski, W., et al.: Progressive Distributed Top-k Retrieval in Peerto- Peer Networks. In: ICDE 2005 (2005)
Babcock, B., Olston, C.: Distributed Top-K Monitoring. In: SIGMOD (2003)
Babcock, B., Olston, C.: Distributed top-k monitoring. Technical report, Stanford University Computer Science Department (2002), http://dbpubs.stanford.edu/pub/2002-61
Carney, D., Cetintemel, U., Cherniack, M., et al.: Monitoring streams - a new class of data management applications. In: VLDB (2002)
Chen, J., DeWitt, D.J., Tian, F., et al.: NiagaraCQ: A scalable continuous query system for internet databases. In: SIGMOD (2000)
Chang, K.C.-C., Hwang, S.-W.: Minimal probing: supporting expensive predicates for top-k queries. In: SIGMOD (2002)
Carey, M.J., Kossmann, D.: On saying “Enough already!” in SQL. In: SIGMOD (1997)
Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: PODC (2004)
Fagin, R.: Combining fuzzy information from multiple systems. J. Comput. System Sci. 58, 83–99 (1999)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)
Güntzer, U., Balke, W.-T., Kieβling, W.: Optimizing multi-feature queries for image databases. In: VLDB (2000)
Gibbons, P.B., Matias, Y.: New sampling-based summary statistics for improving approximate query answers. In: SIGMOD (1998)
Madden, S., Hellerstein, J.M., Shah, M., et al.: Continuously adaptive continuous queries over streams. In: SIGMOD (2002)
Michel, S., Triantafillou, P., Weikum, G.: KLEE: A Framework for Distributed Top-k Query Algorithms. In: VLDB (2005)
Nepal, S., Ramakrishna, M.V.: Query processing issues in image (multimedia) databases. In: ICDE (1999)
Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley Press, Reading (1949)
Zhang, R., Koudas, N., Ooi, B.C., et al.: Multiple Aggregations Over Data Streams. In: SIGMOD (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, B., Jia, Y., Yang, S. (2006). Supporting Efficient Distributed Top-k Monitoring. In: Yu, J.X., Kitsuregawa, M., Leong, H.V. (eds) Advances in Web-Age Information Management. WAIM 2006. Lecture Notes in Computer Science, vol 4016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775300_42
Download citation
DOI: https://doi.org/10.1007/11775300_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35225-9
Online ISBN: 978-3-540-35226-6
eBook Packages: Computer ScienceComputer Science (R0)