Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.
Revised: September 30, 2013 |
Published: June 11, 2013
Citation
Choudhury S., L. Holder, G. Chin, A. Ray, S.J. Beus, and J.T. Feo. 2013.StreamWorks - A system for Dynamic Graph Search. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD 2013), June 22-27, 2013, New York, 1101-1104. New York, New York:ACM.PNNL-SA-92483.doi:10.1145/2463676.2463697