demonstration

StreamWorks: a system for dynamic graph search

Authors:

John FeoAuthors Info & Claims

SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

Pages 1101 - 1104

https://doi.org/10.1145/2463676.2463697

Published: 22 June 2013 Publication History

Get Access

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.

References

[1]

Gephi, an open source graph visualization and manipulation software, www.gephi.org.

Google Scholar

[2]

D. J. Abadi, D. Carney, U. Çetintemel, M. Cherniack, C. Convey, S. Lee, M. Stonebraker, N. Tatbul, and S. Zdonik. Aurora: a new model and architecture for data stream management. The VLDB Journal, 12:120--139, August 2003.

Digital Library

Google Scholar

[3]

S. Chandrasekaran, O. Cooper, A. Deshpande, M. J. Franklin, J. M. Hellerstein, W. Hong, S. Krishnamurthy, S. R. Madden, F. Reiss, and M. A. Shah. Telegraphcq: continuous dataflow processing. SIGMOD '03.

Digital Library

Google Scholar

[4]

J. Chen, D. J. DeWitt, F. Tian, and Y. Wang. Niagaracq: a scalable continuous query system for internet databases. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, SIGMOD '00, pages 379--390, New York, USA, 2000. ACM.

Digital Library

Google Scholar

[5]

L. Chen and C. Wang. Continuous subgraph pattern search over certain and uncertain graph streams. IEEE Trans. on Knowl. and Data Eng., 22(8):1093--1109, Aug. 2010.

Digital Library

Google Scholar

[6]

S. Choudhury, L. Holder, A. Ray, G. Chin, and J. Feo. Continuous queries for multi-relational graphs. Pacific Northwest National Laboratory technical report, PNNL-SA-90326, http://arxiv.org/abs/1209.2178, 2012.

Google Scholar

[7]

W. Fan, J. Li, J. Luo, Z. Tan, X. Wang, and Y. Wu. Incremental graph pattern matching. SIGMOD '11, 2011.

Digital Library

Google Scholar

[8]

Z. Sun, H. Wang, H. Wang, B. Shao, and J. Li. Efficient subgraph matching on billion node graphs. PVLDB, 5(9), 2012.

Digital Library

Google Scholar

Cited By

View all

Guliyev RHaldar AFerhatosmanoglu H(2024)D3-GNN: Dynamic Distributed Dataflow for Streaming Graph Neural NetworksProceedings of the VLDB Endowment10.14778/3681954.368196117:11(2764-2777)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3681961
Shadrooh SNørvåg K(2024)SMoTeF: Smurf money laundering detection using temporal order and flow analysisApplied Intelligence10.1007/s10489-024-05545-454:15-16(7461-7478)Online publication date: 7-Jun-2024
https://doi.org/10.1007/s10489-024-05545-4
Yang RZhang ZZheng WYu J(2023)Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking ReductionProceedings of the ACM on Management of Data10.1145/35886951:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588695
Show More Cited By

Index Terms

StreamWorks: a system for dynamic graph search
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Fast search for dynamic multi-relational graphs
DyNetMM '13: Proceedings of the Workshop on Dynamic Networks Management and Mining

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 ...
Large-scale continuous subgraph queries on streams
HPCDB '11: Proceedings of the first annual workshop on High performance computing meets databases

Graph pattern matching involves finding exact or approximate matches for a query subgraph in a larger graph. It has been studied extensively and has strong applications in domains such as computer vision, computational biology, social networks, security ...
An Efficient Alternative to Subgraph Isomorphism and Its Advantages
ACAI '22: Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence

Subgraph Isomorphism is a fundamental problem in graph theory. It has many applications in social network analysis, molecular investigations, knowledge graphs, etc. Given a Query Graph and a Data Graph, the target of Subgraph Isomorphism, i.e., ...

Comments

Information & Contributors

Information

Published In

SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

June 2013

1322 pages

ISBN:9781450320375

DOI:10.1145/2463676

General Chairs:
Kenneth Ross
Columbia University
,
Divesh Srivastava
AT&T Research
,
Program Chair:
Dimitris Papadias
HKUST

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Demonstration

Conference

SIGMOD/PODS'13

Sponsor:

SIGMOD

SIGMOD/PODS'13: International Conference on Management of Data

June 22 - 27, 2013

New York, New York, USA

Acceptance Rates

SIGMOD '13 Paper Acceptance Rate 76 of 372 submissions, 20%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
544
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)1

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Guliyev RHaldar AFerhatosmanoglu H(2024)D3-GNN: Dynamic Distributed Dataflow for Streaming Graph Neural NetworksProceedings of the VLDB Endowment10.14778/3681954.368196117:11(2764-2777)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3681961
Shadrooh SNørvåg K(2024)SMoTeF: Smurf money laundering detection using temporal order and flow analysisApplied Intelligence10.1007/s10489-024-05545-454:15-16(7461-7478)Online publication date: 7-Jun-2024
https://doi.org/10.1007/s10489-024-05545-4
Yang RZhang ZZheng WYu J(2023)Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking ReductionProceedings of the ACM on Management of Data10.1145/35886951:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588695
Du XTao ZLi L(2022)Dynamic Graph Pattern Matching in Medical Knowledge Graphs2022 4th International Conference on Data Intelligence and Security (ICDIS)10.1109/ICDIS55630.2022.00054(306-313)Online publication date: Aug-2022
https://doi.org/10.1109/ICDIS55630.2022.00054
Min SPark SPark KGiammarresi DItaliano GHan W(2021)Symmetric continuous subgraph matching with bidirectional dynamic programmingProceedings of the VLDB Endowment10.14778/3457390.345739514:8(1298-1310)Online publication date: 21-Oct-2021
https://dl.acm.org/doi/10.14778/3457390.3457395
Ahmed NDuffield NRossi R(2021)Online Sampling of Temporal NetworksACM Transactions on Knowledge Discovery from Data10.1145/344220215:4(1-27)Online publication date: 18-Apr-2021
https://dl.acm.org/doi/10.1145/3442202
Wang ZHu WChen GYuan CGu RHuang Y(2021)Towards Efficient Distributed Subgraph Enumeration Via Backtracking-Based FrameworkIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.307624632:12(2953-2969)Online publication date: 1-Dec-2021
https://doi.org/10.1109/TPDS.2021.3076246
Zhang QGuo DZhao XWang X(2021)Continuous matching of evolving patterns over dynamic graph dataWorld Wide Web10.1007/s11280-020-00860-524:3(721-745)Online publication date: 13-Apr-2021
https://doi.org/10.1007/s11280-020-00860-5
Starnini MTsourakakis CZamanipour MPanisson AAllasia WFornasiero MPuma LRicci VRonchiadin SUgrinoska AVaretto MMoncalvo D(2021)Smurf-Based Anti-money Laundering in Time-Evolving Transaction NetworksMachine Learning and Knowledge Discovery in Databases. Applied Data Science Track10.1007/978-3-030-86514-6_11(171-186)Online publication date: 10-Sep-2021
https://doi.org/10.1007/978-3-030-86514-6_11
Sun XTan YWu QWang JShen C(2019)New Algorithms for Counting Temporal Graph PatternSymmetry10.3390/sym1110118811:10(1188)Online publication date: 20-Sep-2019
https://doi.org/10.3390/sym11101188
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fast search for dynamic multi-relational graphs

Large-scale continuous subgraph queries on streams

An Efficient Alternative to Subgraph Isomorphism and Its Advantages