Abstract
Queries that return a list of frequently occurring items are important in the analysis of real-time Internet packet streams. While several results exist for computing Top-k queries using limited memory in the infinite stream model (e.g., limited-memory sliding windows). To compute the statistics over a sliding window, a synopsis data structure can be maintained for the stream to compute the statistics rapidly. Usually, a Top-k query is always processed over an equal synopsis, but it’s very hard to implement over an unequal synopsis because of the resulting inaccurate approximate answers. Therefore, in this paper, we focus on periodically refreshed Top-k queries over sliding windows on Internet traffic streams; we present a deterministic DSW (Dynamic Sub-Window) algorithm to support the processing of Top-k aggregate queries over an unequal synopsis and guarantee the accuracy of the approximation results.
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
Golab, L., Ozsu, M.T.: Issues in data stream management. ACM SIGMOD Record 32(2), 5–14 (2003)
Cranor, C., Gao, Y., Johnson, T., Shkapenyunk, V., Spatscheck, O.: Gigascope: High performance network monitoring with an SQL interface. In: 2002 ACM SIGMOD international conference on Management of data, pp. 623–623. ACM Press, New York (2002)
Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data streams. In: 21st ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 1–16. ACM Press, New York (2002)
Demaine, E., Lopez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 348–360. Springer, Heidelberg (2002)
Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring for top-k queries over sliding windows. In: 2006 ACM SIGMOD international conference on Management of data, pp. 635–646. ACM Press, New York (2006)
Lee, Y.K., Jung, Y.J., Ryu, K.H.: Design and Implementation of a System for Environmental Monitoring Sensor Network. In: Chang, K.C.-C., Wang, W., Chen, L., Ellis, C.A., Hsu, C.-H., Tsoi, A.C., Wang, H. (eds.) APWeb/WAIM 2007. LNCS, vol. 4537, pp. 223–228. Springer, Heidelberg (2007)
Zhu, Y.Y., Sasha, D.: Statistical monitoring of thousands of data streams in real time. In: VLDB 2002, 28th International Conference on Very Large Data Bases, pp. 358–369. VLDB Press, Hong Kong (2002)
Cohen, S.: User-defined aggregate functions: bridging theory and practice. In: 2006 ACM SIGMOD international conference on Management of data, pp. 49–60. ACM Press, Chicago (2006)
Bulut, A., Singh, A.K.: A unified framework for monitoring data streams in real time. In: 21st International Conference on Data Engineering, ICDE 2005, pp. 44–55. IEEE Press, Tokyo (2005)
Li, J., Maier, D., Tufte, K., Papadimos, V., Tucker, P.A.: No pane, no gain: efficient evaluation of sliding-window aggregates over data streams. ACM SIGMOD Rocord 34(1), 39–44 (2005)
Krishnamurthy, S., Wu, C., Franklin, M.J.: On-the-fly sharing for streamed aggregation. In: 2006 ACM SIGMOD international conference on Management of data, pp. 623–634. ACM Press, Chicago (2006)
Toman, D.: On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries. In: 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), pp. 150–162. IEEE Press, Alicante (2007)
Garofalakis, M.N., Gibbons, P.B.: Wavelet synopses with error guarantees. In: 2002 ACM SIGMOD international conference on Management of data, pp. 476–487. ACM Press, Madison (2002)
Matias, Y., Uriel, D.: Optimal workload-based weighted wavelet synopses. Theoretical Computer Science 371, 227–246 (2007)
He, W.M., Fegaras, L., Levine, D.: Indexing and searching XML documents based on content and structure synopses. In: Cooper, R., Kennedy, J. (eds.) BNCOD 2007. LNCS, vol. 4587, pp. 58–69. Springer, Heidelberg (2007)
Golab, L., DeHaan, D., Demaine, E.D., Lopez-Ortiz, A., Munro, J.I.: Identifying frequent items in sliding windows over on-line packet streams. In: 3rd ACM SIGCOMM conference on Internet measurement, pp. 173–178. ACM Press, Miami Beach (2003)
Ilyas, I.F.: Rank-aware query processing and optimization. PhD thesis, Purdue University (2004)
Babcock, B., Olston, C.: Distributed top-k monitoring. In: 2003 ACM SIGMOD international conference, pp. 28–39. ACM Press, San Diego (2003)
Golab, L., DeHaan, D., Lopez-Ortiz, A., Demaine, E.D.: Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies. In: 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), pp. 425–425. IEEE Press, Santorini Island (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Koo Lee, Y., Ryu, K.H. (2008). Supporting Top-K Aggregate Queries over Unequal Synopsis on Internet Traffic Streams. In: Zhang, Y., Yu, G., Bertino, E., Xu, G. (eds) Progress in WWW Research and Development. APWeb 2008. Lecture Notes in Computer Science, vol 4976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78849-2_59
Download citation
DOI: https://doi.org/10.1007/978-3-540-78849-2_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78848-5
Online ISBN: 978-3-540-78849-2
eBook Packages: Computer ScienceComputer Science (R0)