Fast Search for Dynamic Multi-Relational Graphs

Conference · Sun Jun 23 00:00:00 EDT 2013

DOI:https://doi.org/10.1145/2489247.2489251· OSTI ID:1144833

Choudhury, Sutanay; Holder, Larry; Chin, George; Feo, John T.

Acting on time-critical events by processing ever growing social media or news streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Continuous queries or techniques to search for rare events that typically arise in monitoring applications have been studied extensively for relational databases. This work is dedicated to answer the question that emerges naturally: how can we efficiently execute a continuous query on a dynamic graph? This paper presents an exact subgraph search algorithm that exploits the temporal characteristics of representative queries for online news or social media monitoring. The algorithm is based on a novel data structure called the that leverages the structural and semantic characteristics of the underlying multi-relational graph. The paper concludes with extensive experimentation on several real-world datasets that demonstrates the validity of this approach.

• Research Organization: Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC05-76RL01830
• OSTI ID: 1144833
• Report Number(s): PNNL-SA-94808; 400470000
• Resource Relation: Conference: ACM SIGMOD Workshop on Dynamic Networks Management and Mining (DyNetMM 2013), June 22-27, 2013, New York, 1-8
• Country of Publication: United States
• Language: English