Abstract
MAX and MIN are two important aggregates offered by the original SQL specification. In the paper, we propose a novel mechanism, i.e. the exemplary sketch, to evaluate MAX and MIN over sliding windows with various size in the data stream environment. Performance analysis shows that evaluating MAX or MIN over w sliding windows with various size using the exemplary sketch takes O(ln n) expected amortized space and O(w) expected amortized evaluation time, where n is the number of the tuples fall into the maximal size sliding window. Moreover, the sliding-window semantics can also be integrated into the exemplary sketch, which means that we no longer need to buffer all the tuples fall into current sliding windows separately for implementing the sliding-window semantics all alone. Experimental results show that the sketch scheme yields very good performance on both space and time cost.
Supported by State Key Laboratory of Networking and Switching Technology, NSFC Grant 60473051 and 60503037, and NSFBC Grant 4062018.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Babu, S., Widom, J.: Continuous Queries over Data Streams. SIGMOD Record 30(3), 109–120 (2001)
Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and Issues in Data Stream Systems. In: Proceedings of PODS, pp. 1–16 (2002)
Arasu, A., Manku, G.S.: Approximate Counts and Quantiles over Sliding Windows. In: Proceedings of PODS, pp. 286–296 (2004)
Chandrasekaran, S., Franklin, M.J.: Streaming Queries over Streaming Data. In: Proceedings of VLDB, pp. 203–214 (2002)
Gibbons, P.B., Tirthapura, S.: Distributed Streams Algorithms for Sliding Windows. In: Proceedings of SPAA, pp. 63–72 (2002)
Li, J., Maier, D., Tufte, K., Papadimos, V., Tucker, P.A.: No Pane, No Gain: Efficient Evaluation of Sliding-Window Aggregates over Data Streams. SIGMOD Record 34(1), 39–44 (2005)
Li, J., Maier, D., Tufte, K., Papadimos, V., Tucker, P.A.: Semantics and Evaluation Techniques for Window Aggregates in Data Streams. In: Proceedings of SIGMOD, pp. 311–322 (2005)
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub Totals. Data Mining and Knowledge Discovery 1(1), 29–53 (1997)
Arasu, A., Widom, J.: Resource Sharing in Continuous Sliding-Window Aggregates. In: Proceedings of VLDB, pp. 336–347 (2004)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation Service For Ad-Hoc Sensor Networks. ACM SIGOPS Operating Systems Review 36(SI), 131–146 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, J., Yang, D., Cui, B., Chen, L., Gao, J. (2007). Evaluating MAX and MIN over Sliding Windows with Various Size Using the Exemplary Sketch. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)