A shared execution strategy for multiple pattern mining requests over streaming data

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 874-885

  Yang, Di ^a   Rundensteiner, Elke A ^a   Ward, Matthew O ^a  

^a Worcester Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMMERCE; DATA COMMUNICATION SYSTEMS; DATA MINING; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC TRADING; PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC COMPLEXITY; COMPACT STRUCTURES; DIVERSE APPLICATIONS; EXECUTION STRATEGIES; INTEGRATED MAINTENANCE; SIMILAR PATTERN MINING; STREAMING APPLICATIONS; TRAFFIC MONITORING;

COMPUTATIONAL COMPLEXITY;

EID: 77954738342     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687726     Document Type: Article

References (20)

1. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In VLDB, pages 81-92, 2003.
2. A. Arasu, S. Babu, and J. Widom. The cql continuous query language: semantic foundations and query execution. VLDB J., 15(2):121-142, 2006.
3. A. Arasu and J. Widom. Resource sharing in continuous sliding-window aggregates. In VLDB, pages 336-347, 2004.
4. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan. Maintaining variance and k-medians over data stream windows. In PODS, pages 234-243, 2003.
5. F. Cao, M. Ester, W. Qian, and A. Zhou. Density-based clustering over an evolving data stream with noise. In SDM, 2006.
6. Y. Chen and L. Tu. Density-based clustering for real-time stream data. In KDD, pages 133-142, 2007.
7. J. N. Entzminger, C. A. Fowler, and W. J. Kenneally. Jointstars and gmti: Past, present and future. IEEE Transactions on Aerospace and Electronic Systems, 35(2):748-762, april 1999.
8. M. Ester, H.-P. Kriegel, J. Sander, M. Wimmer, and X. Xu. Incremental clustering for mining in a data warehousing environment. In VLDB, pages 323-333, 1998.
9. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226-231, 1996.
10. M. A. Hammad, M. J. Franklin, W. G. Aref, and A. K. Elmagarmid. Scheduling for shared window joins over data streams. In VLDB, pages 297-308, 2003.
11. J. A. Hartigan and M. A. Wong. A k-means clustering algorithm. Applied Statistics, 28(1).
12. I. INETATS. Stock trade traces. http://www.inetats.com/.
13. S. Krishnamurthy, M. J. Franklin, J. M. Hellerstein, and G. Jacobson. The case for precision sharing. In VLDB, pages 972-986, 2004.
14. S. Krishnamurthy, C. Wu, and M. J. Franklin. On-the-fly sharing for streamed aggregation. In SIGMOD Conference, pages 623-634, 2006.
15. S. Wang, E. A. Rundensteiner, S. Ganguly, and S. Bhatnagar. State-slice: New paradigm of multi-query optimization of window-based stream queries. In VLDB, pages 619-630, 2006.
16. D. Yang, E. A. Rundensteiner, and M. O. Ward. Highly efficient neighbor-based pattern detection over streaming windows. WPI Technical Report WPI-CS-TR-09-06, june 2009.
17. D. Yang, E. A. Rundensteiner, and M. O. Ward. Multiple query optimization for density-based clustering queries over streaming windows. WPI Technical Report: WPI-CS-TR-09-04, april 2009.
18. D. Yang, E. A. Rundensteiner, and M. O. Ward. Neighbor-based pattern detection for windows over streaming data. In EDBT, pages 529-540, 2009.
19. Y. Yuan, X. Lin, Q. Liu, W. Wang, J. X. Yu, and Q. Zhang. Efficient computation of the skyline cube. In VLDB, pages 241-252, 2005.
20. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: An efficient data clustering method for very large databases. SIGMOD Record, vol.25(2), p. 103-14, 1996.