StreamWorks: a system for dynamic graph search

Authors:
Sutanay Choudhury;Lawrence Holder;George Chin;Abhik Ray;Sherman Beus;John Feo
Affiliations:
Pacific Northwest National Laboratory, Rchland, WA, USA;Washington State University, Pullman, WA, USA;Pacific Northwest National Laboratory, Richland, WA, USA;Washington State University, Pullman, WA, USA;Pacific Northwest National Laboratory, Richland, WA, USA;Pacific Northwest National Laboratory, Richland, WA, USA
Venue:
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Year:
2013

Citing 6
Cited 0

NiagaraCQ: a scalable continuous query system for Internet databases

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
TelegraphCQ: continuous dataflow processing

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Aurora: a new model and architecture for data stream management

The VLDB Journal — The International Journal on Very Large Data Bases
Continuous Subgraph Pattern Search over Certain and Uncertain Graph Streams

IEEE Transactions on Knowledge and Data Engineering
Incremental graph pattern matching

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient subgraph matching on billion node graphs

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.