Stream cube: An architecture for multi-dimensional analysis of data streams

被引:79
作者
Han, JW [1 ]
Chen, YX
Dong, GZ
Pei, H
Wah, BW
Wang, JY
Cai, YD
机构
[1] Univ Illinois, Chicago, IL 60680 USA
[2] Washington Univ, St Louis, MO 63130 USA
[3] Wright State Univ, Dayton, OH 45435 USA
[4] Simon Fraser Univ, Burnaby, BC V5A 1S6, Canada
[5] Tsinghua Univ, Beijing 100084, Peoples R China
基金
美国国家科学基金会;
关键词
29;
D O I
10.1007/s10619-005-3296-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Real-time surveillance systems, telecommunication systems, and other dynamic environments often generate tremendous (potentially infinite) volume of stream data: the volume is too huge to be scanned multiple times. Much of such data resides at rather low level of abstraction, whereas most analysts are interested in relatively high-level dynamic changes (such as trends and outliers). To discover such high-level characteristics, one may need to perform on-line multi-level, multi-dimensional analytical processing of stream data. In this paper, we propose an architecture, called stream-cube, to facilitate on-line, multi-dimensional, multi-level analysis of stream data. For fast online multi-dimensional analysis of stream data, three important techniques are proposed for efficient and effective computation of stream cubes. First, a tilted time frame model is proposed as a multi-resolution model to register time-related data: the more recent data are registered at finer resolution, whereas the more distant data are registered at coarser resolution. This design reduces the overall storage of time-related data and adapts nicely to the data analysis tasks commonly encountered in practice. Second, instead of materializing cuboids at all levels, we propose to maintain a small number of critical layers. Flexible analysis can be efficiently performed based on the concept of observation layer and minimal interesting layer. Third, an efficient stream data cubing algorithm is developed which computes only the layers (cuboids) along a popular path and leaves the other cuboids for query-driven, on-line computation. Based on this design methodology, stream data cube can be constructed and maintained incrementally with a reasonable amount of memory, computation cost, and query response time. This is verified by our substantial performance study. Stream data cube architecture facilitates online analytical processing of stream data. It also forms a preliminary data structure for online stream data mining. The impact of the design and implementation of stream data cube in the context of stream data mining is also discussed in the paper.
引用
收藏
页码:173 / 197
页数:25
相关论文
共 29 条
[1]  
Agarwal S, 1996, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P506
[2]  
Aggarwal C., 2003, P 2003 INT C VER LAR
[3]  
Aggarwal C. C., 2004, P 30 INT C VER LARG, V30, P852, DOI DOI 10.1016/B978-012088469-8.50075-9
[4]  
AGGARWAL CC, 2004, P 10 ACM SIGKDD INT, P503, DOI DOI 10.1145/1014052.1014110
[5]  
AGRAWAL R, 1995, PROC INT CONF DATA, P3, DOI 10.1109/ICDE.1995.380415
[6]  
[Anonymous], P 1997 ACM SIGMOD IN, DOI [10.1145/253260.253288, DOI 10.1145/253260.253288]
[7]  
[Anonymous], P 2002 INT C VER LAR
[8]  
[Anonymous], P 2001 INT C VER LAR
[9]  
Babcock B., 2002, Proceedings of the Twenty-First ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), P1, DOI DOI 10.1145/543613.543615
[10]  
Babu S, 2001, SIGMOD REC, V30, P109, DOI 10.1145/603867.603884