Author:
Papapetrou Odysseas,Garofalakis Minos,Deligiannakis Antonios
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems
Reference35 articles.
1. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)
2. Arlitt, M., Jin, T.: A workload characterization study of the 1998 world cup web site. Network 14(3), 30–37 (2000)
3. Busch, C., Tirthapura, S.: A deterministic algorithm for summarizing asynchronous streams over a sliding window. In: STACS, pp. 465–476 (2007)
4. Chakrabarti, A., Cormode, G., Mcgregor, A.: A near-optimal algorithm for estimating the entropy of a stream. ACM Trans. Algorithms 6(3), 51:1–51:21 (2010)
5. Chan, H.L., Lam, T.W., Lee, L.K., Ting, H.F.: Continuous monitoring of distributed data streams over a time-based sliding window. Algorithmica 62(3–4), 1088–1111 (2012)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximate Matrix Multiplication over Sliding Windows;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
2. OmniSketch: Efficient Multi-Dimensional High-Velocity Stream Analytics with Arbitrary Predicates;Proceedings of the VLDB Endowment;2023-11
3. LAQy: Efficient and Reusable Query Approximations via Lazy Sampling;Proceedings of the ACM on Management of Data;2023-06-13
4. Box queries over multi-dimensional streams;Information Systems;2022-11
5. Truly Perfect Samplers for Data Streams and Sliding Windows;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12