Sketchbased querying of distributed slidingwindow data streams

Proceedings of the VLDB Endowment

Volumn 5, Issue 10, 2012, Pages 992-1003

  Papapetrou, Odysseas ^a   Garofalakis, Minos ^a   Deligiannakis, Antonios ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; DATA MINING; DECODING;

ALGORITHMIC SOLUTIONS; DATA MANAGEMENT SYSTEM; DISTRIBUTED DATA STREAMS; DISTRIBUTED ENVIRONMENTS; EMERGING APPLICATIONS; HIGH-DIMENSIONAL DATA STREAMS; SKETCH-BASED QUERYING; SLIDING WINDOW MODELS;

INFORMATION MANAGEMENT;

EID: 84872764287     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2336664.2336672     Document Type: Article

References (27)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
2. M. Arlitt and T. Jin. A workload characterization study of the 1998 world cup web site. Network, 14(3):30 -37, 2000.
3. C. Busch and S. Tirthapura. A deterministic algorithm for summarizing asynchronous streams over a sliding window. In STACS, pages 465-476, 2007.
4. H.-L. Chan, T.-W. Lam, L.-K. Lee, and H.-F. Ting. Continuous monitoring of distributed data streams over a time-based sliding window. Algorithmica, 62(3-4):1088-1111, 2012.
5. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In ICALP, pages 693-703, 2002.
6. E. Cohen and M. J. Strauss. Maintaining time-decaying stream aggregates. J. Algorithms, 59(1):19-36, 2006.
7. G. Cormode and M. Garofalakis. Approximate continuous querying over distributed streams. ACM Trans. Database Syst., 33(2), 2008.
8. G. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In SIGMOD, pages 25-36, 2005.
9. G. Cormode and S. Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. In PODS, pages 296-306, 2003.
10. G. Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms, 55(1):58-75, 2005.
11. G. Cormode, S. Tirthapura, and B. Xu. Time-decaying sketches for robust aggregation of sensor data. SIAM J. Comput., 39(4):1309-1339, 2009.
12. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM J. Comput., 31(6):1794-1813, 2002.
13. X. A. Dimitropoulos, M. P. Stoecklin, P. Hurley, and A. Kind. The eternal sunshine of the sketch data structure. Computer Networks, 52(17):3248-3257, 2008.
14. P. B. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB, pages 541-550, 2001.
15. P. B. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In SPAA, pages 63-72, 2002.
16. M. B. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In SIGMOD, pages 58-66, 2001.
17. L. Huang, M. Garofalakis, A. Joseph, and N. Taft. Communication efficient tracking of distributed cumulative triggers. In ICDCS, 2007.
18. L. Huang, X. Nguyen, M. Garofalakis, J. Hellerstein, M. Jordan, A. Joseph, and N. Taft. Communication-efficient online detection of network-wide anomalies. In INFOCOM, pages 134-142, 2007.
19. R. Y. S. Hung and H.-F. Ting. Finding heavy hitters over the sliding window of a weighted data stream. In LATIN, pages 699-710, 2008.
20. A. Jain, J. M. Hellerstein, S. Ratnasamy, and D. Wetherall. A wakeup call for internet monitoring systems: The case for distributed triggers. In SIGCOMM Workshop on Hot Topics in Networks (HotNets), 2004.
21. D. Kotz, T. Henderson, I. Abyzov, and J. Yeo. CRAWDAD trace set dartmouth/campus/snmp (v. 2004-11-09). http://crawdad.cs.dartmouth.edu/dartmouth/campus/snmp.
22. J. Mirkovic, G. Prier, and P. L. Reiher. Attacking DDoS at the source. In ICNP, pages 312-321, 2002.
23. C. Olston, J. Jiang, and J. Widom. Adaptive filters for continuous queries over distributed data streams. In SIGMOD, pages 563-574, 2003.
24. L. Qiao, D. Agrawal, and A. El Abbadi. Supporting sliding window queries for continuous data streams. In SSDBM, pages 85-96, 2003.
25. I. Sharfman, A. Schuster, and D. Keren. A geometric approach to monitoring threshold functions over distributed data streams. In SIGMOD, pages 301-312, 2006.
26. S. Tirthapura, B. Xu, and C. Busch. Sketching asynchronous streams over a sliding window. In PODC, pages 82-91, 2006.
27. B. Xu, S. Tirthapura, and C. Busch. Sketching asynchronous data streams over sliding windows. Distributed Computing, 20(5):359-374, 2008.