Fast approximate correlation for massive time-series data

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 171-182

  Mueen, Abdullah ^a   Nath, Suman ^b   Liu, Jie ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

correlation matrix; discrete fourier transform

Indexed keywords

APPROXIMATE SOLUTION; AUTOMATIC DISCOVERY; CORRELATION COEFFICIENT; CORRELATION MATRIX; DATA CENTER MANAGEMENT; DATA REUSE; DATA-INTENSIVE APPLICATION; DISCRETE FOURIER TRANSFORMATION; DISK I/O; END-TO-END RESPONSE TIME; ENVIRONMENTAL MONITORING; ERROR BOUND; EXACT ALGORITHMS; EXACT SOLUTION; FALSE POSITIVE; GRAPH PARTITIONING; INPUT SIGNAL; NOVEL ALGORITHM; PAIR CORRELATIONS; REAL APPLICATIONS; REAL DATA SETS; TIME-SERIES DATA;

BLOCK CODES; CORRELATION METHODS; COST REDUCTION; DISCRETE FOURIER TRANSFORMS; ENVIRONMENTAL MANAGEMENT; FOURIER ANALYSIS; GRAPH THEORY; PROBLEM SOLVING; WAREHOUSES; WAVELET TRANSFORMS;

APPROXIMATION ALGORITHMS;

EID: 77954730855     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807188     Document Type: Conference Paper

References (27)

1. R. Agrawal, C. Faloutsos, and A. N. Swami. Efficient similarity search in sequence databases. In 4th International Conference on Foundations of Data Organization and Algorithms (FODO), 1993.
2. R. Cole, D. Shasha, and X. Zhao. Fast window correlations over uncooperative time series. In SIGKDD, pages 743-749, 2005.
3. G. Even. Fast approximate graph partitioning algorithms. SIAM J. Comput., 28(6):2187-2214, 1999.
4. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In SIGMOD, 1994.
5. C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel, and L. A. Wolsey. The node capacitated graph partitioning problem: a computational study. Math. Program., 81(2):229-256, 1998.
6. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In DAC '82: Proceedings of the 19th Design Automation Conference, pages 175-181, 1982.
7. J. Gehrke, F. Korn, and D. Srivastava. On computing correlated aggregates over continual data streams. In SIGMOD, 2001.
8. A. Hagen, L. Kahng. Fast spectral methods for ratio cut partitioning and clustering. In Computer-Aided Design, 1991., pages 10-13, 1991.
9. T. Hey, S. Tansley, and K. Tolle. The Fourth Paradigm: Data-Intensive Scientific Discovery. Microsoft Research, 2009.
10. E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. KAIS, 3:263-286, 2000.
11. E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra. Locally adaptive dimensionality reduction for indexing large time series databases. SIGMOD Rec., 30:151-162, 2001. (Pubitemid 33604441)
12. C.-S. Li, P. S. Yu, and V. Castelli. HierarchyScan: A hierarchical similarity search algorithm for databases of long sequences. In ICDE, 1996.
13. X. Lian and L. Chen. Efficient similarity search over future stream time series. TKDE, 20(1):40-54, 2008.
14. X. Lian, L. Chen, and B. Wang. Approximate similarity search over multiple stream time series. In Advances in Databases: Concepts, Systems and Applications, pages 962-968, 2008.
15. X. Lian, L. Chen, J. X. Yu, J. Han, and J. Ma. Multiscale representations for fast pattern matching in stream time series. TKDE, 21(4):568-581, 2009.
16. C. Loboz, S. Smyl, and S. Nath. Datagarage: Warehousing massive amounts of performance data on commodity servers. Technical Report MSR-TR-2010-22, Microsoft Research, March 2010.
17. S. Papadimitriou, J. Sun, and C. Faloutsos. Streaming pattern discovery in multiple time-series. In VLDB, pages 697-708, 2005.
18. D. Rafiei. On similarity-based queries for time series data. In ICDE, 1999.
19. D. Rafiei and A. Mendelzon. Similarity-based queries for time series data. In SIGMOD, 1997.
20. G. Reeves, J. Liu, S. Nath, and F. Zhao. Managing massive time series streams with multiscale compressed trickles. In VLDB, 2009.
21. Y. Sakurai, S. Papadimitriou, and C. Faloutsos. BRAID: stream mining through group lag correlations. In SIGMOD, 2005.
22. M. Vlachos, S. S. Kozat, and P. S. Yu. Optimal distance bounds on time-series data. In SDM, 2009.
23. M. Vlachos, C. Meek, Z. Vagena, and D. Gunopulos. Identifying similarities, periodicities and bursts for online search queries. In SIGMOD, 2004.
24. M. Wang, S. Lim, J. Cong, and M. Sarrafzadeh. Multi-way partitioning using bi-partition heuristics. In Proceedings of the 2000 Asia and South Pacific Design Automation Conference, 2000.
25. H. Yang and D. F. Wong. Efficient network flow based min-cut balanced partitioning. In Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, pages 50-55, 1994.
26. B.-K. Yi, N. Sidiropoulos, T. Johnson, A. Biliris, H. Jagadish, and C. Faloutsos. Online data mining for co-evolving time sequences. ICDE, 2000.
27. Y. Zhu and D. Shasha. StatStream: statistical monitoring of thousands of data streams in real time. In VLDB, 2002.