Event Pattern Matching over Graph Streams

被引:51
作者
Song, Chunyao [1 ]
Ge, Tingjian [1 ]
Chen, Cindy [1 ]
Wang, Jie [1 ]
机构
[1] Univ Massachusetts, Lowell, MA 01854 USA
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2014年 / 8卷 / 04期
基金
美国国家科学基金会;
关键词
D O I
10.14778/2735496.2735504
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A graph is a fundamental and general data structure underlying all data applications. Many applications today call for the management and query capabilities directly on graphs. Real time graph streams, as seen in road networks, social and communication networks, and web requests, are such applications. Event pattern matching requires the awareness of graph structures, which is different from traditional complex event processing. It also requires a focus on the dynamicity of the graph, time order constraints in patterns, and online query processing, which deviates significantly from previous work on subgraph matching as well. We study the semantics and efficient online algorithms for this important and intriguing problem, and evaluate our approaches with extensive experiments over real world datasets in four different domains.
引用
收藏
页码:413 / 424
页数:12
相关论文
共 31 条
[1]  
Aggarwal CC, 2010, ADV DATABASE SYST, V40, P1, DOI 10.1007/978-1-4419-6045-0
[2]  
AGRAWAL J, 2008, SIGMOD
[3]  
[Anonymous], 2011, P 2011 C EMP METH NA
[4]  
[Anonymous], 2009, CISC VIS NETW IND GL
[5]  
Chen L., 2010, TKDE
[6]  
Cheng J., 2013, ICDE
[7]  
Corman T.H., 2009, INTRO ALGORITHMS, V3
[8]  
Cormode G., 2005, PODS
[9]  
EAGLE N, 2006, J PERSONAL UBIQUITOU
[10]  
Fan W., 2010, VLDB