abstract

Simulation-based Approximate Graph Pattern Matching

Author:

Xiaoshuang ChenAuthors Info & Claims

SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data

Pages 2825 - 2827

https://doi.org/10.1145/3318464.3384401

Published: 31 May 2020 Publication History

Abstract

Graph pattern matching is a fundamental problem in analyzing attributed graphs, that is to search the matches of a given query graph in a large data graph. However, existing algorithms either encounter with the performance issues or cannot capture reasonable matches. In this paper, we propose a simulation-based approximate pattern matching algorithm that is not only efficient to compute, but also able to capture those reasonable matches (missed by existing algorithms)

References

[1]

F. Bi, L. Chang, X. Lin, L. Qin, and W. Zhang. Efficient subgraph matching by postponing cartesian products. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD '16, pages 1199--1214, New York, NY, USA, 2016. ACM.

Digital Library

[2]

S. Dutta, P. Nayek, and A. Bhattacharya. Neighbor-aware search for approximate labeled graph matching using the chi-square statistics. In Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3--7, 2017, pages 1281--1290, 2017.

Digital Library

[3]

W. Fan, J. Li, S. Ma, N. Tang, and Y. Wu. Adding regular expressions to graph reachability and pattern queries. In Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11--16, 2011, Hannover, Germany, pages 39--50, 2011.

Digital Library

[4]

W. Fan, J. Li, S. Ma, N. Tang, Y. Wu, and Y. Wu. Graph pattern matching: From intractable to polynomial time. PVLDB, 3(1):264--275.

[5]

M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.

Digital Library

[6]

W.-S. Han, J. Lee, and J.-H. Lee. Turboiso: Towards ultrafast and robust subgraph isomorphism search in large graph databases. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD '13, pages 337--348, New York, NY, USA, 2013. ACM.

Digital Library

[7]

A. Khan, N. Li, X. Yan, Z. Guan, S. Chakraborty, and S. Tao. Neighborhood based fast graph search in large networks. In Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12--16, 2011, pages 901--912, 2011.

Digital Library

[8]

A. Khan, Y. Wu, C. C. Aggarwal, and X. Yan. Nema: Fast graph search with label similarity. PVLDB, 6(3):181--192, 2013.

Digital Library

[9]

S. Ma, Y. Cao, W. Fan, J. Huai, and T. Wo. Capturing topology in graph pattern matching. PVLDB, 5(4):310--321, 2011.

Digital Library

[10]

S. Ma, Y. Cao, W. Fan, J. Huai, and T. Wo. Strong simulation: Capturing topology in graph pattern matching. ACM Trans. Database Syst., 39(1):4:1--4:46, 2014.

Digital Library

[11]

R. Milner. Communication and concurrency, volume 84. Prentice hall New York etc., 1989.

[12]

H. Shang, Y. Zhang, X. Lin, and J. X. Yu. Taming verification hardness: An efficient algorithm for testing subgraph isomorphism. Proc. VLDB Endow., 1(1):364--375, Aug. 2008.

Digital Library

[13]

C. Song, T. Ge, C. X. Chen, and J. Wang. Event pattern matching over graph streams. PVLDB, 8(4):413--424, 2014.

Digital Library

[14]

H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-Rad. Fast best-effort pattern matching in large attributed graphs. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, USA, August 12--15, 2007, pages 737--746, 2007.

Digital Library

[15]

J. R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, 23(1):31--42, Jan. 1976.

Digital Library

[16]

S. Zhang, J. Yang, and W. Jin. SAPPER: subgraph indexing and approximate matching in large graphs. PVLDB, 3(1):1185--1194, 2010.

Digital Library

[17]

G. Zhu, X. Lin, K. Zhu, W. Zhang, and J. X. Yu. Treespan: Efficiently computing similarity all-matching. In Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, SIGMOD '12, pages 529--540. ACM, 2012.

Digital Library

Cited By

Qiao LQu RSong QLyu XWang LQi J(2023)Graph Pattern Matching Based Intelligent Operation and Maintenance Method for Cloud Resource Operation2023 8th International Conference on Data Science in Cyberspace (DSC)10.1109/DSC59305.2023.00089(571-578)Online publication date: 18-Aug-2023
https://doi.org/10.1109/DSC59305.2023.00089
Agarwal SDutta SBhattacharya ADemartini GZuccon GCulpepper JHuang ZTong H(2021)VerSaChIProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482217(2812-2816)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482217
Fuller MBrighton ESchiewe MDas DCerny TTisnovsky PHung CHong JBechini ASong E(2021)Automated error log resolutionProceedings of the 36th Annual ACM Symposium on Applied Computing10.1145/3412841.3442004(1298-1304)Online publication date: 22-Mar-2021
https://dl.acm.org/doi/10.1145/3412841.3442004

Index Terms

Simulation-based Approximate Graph Pattern Matching
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching

Recommendations

Incremental graph pattern matching

Graph pattern matching is commonly used in a variety of emerging applications such as social network analysis. These applications highlight the need for studying the following two issues. First, graph pattern matching is traditionally defined in terms ...
Towards efficient simulation-based constrained temporal graph pattern matching
Abstract
In the context of searching a single data graph G, graph pattern matching is to find all the occurrences of a pattern graph Q in G, specified by a matching rule. It is of paramount importance in many real applications such as social network ...
Personalized graph pattern matching via limited simulation

It is well known that graph simulation and bisimulation can capture the semantics of graphs, described by the type and attribute of the nodes and edges. Graph pattern matching via simulation has been widely used in a variety of applications such as ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data

June 2020

2925 pages

ISBN:9781450367356

DOI:10.1145/3318464

General Chairs:
David Maier
Portland State University, USA
,
Rachel Pottinger
University of British Columbia, Canada
,
Program Chairs:
AnHai Doan
University of Wisconsin, USA
,
Wang-Chiew Tan
Megagon Labs, USA
,
Publications Chairs:
Abdussalam Alawini
University of Illinois at Urbana-Champaign, USA
,
Hung Q. Ngo
RelationalAI, USA

Copyright © 2020 Owner/Author.

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 May 2020

Check for updates

Author Tags

Qualifiers

Abstract

Conference

SIGMOD/PODS '20

Sponsor:

SIGMOD

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

June 14 - 19, 2020

OR, Portland, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
356
Total Downloads

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

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Qiao LQu RSong QLyu XWang LQi J(2023)Graph Pattern Matching Based Intelligent Operation and Maintenance Method for Cloud Resource Operation2023 8th International Conference on Data Science in Cyberspace (DSC)10.1109/DSC59305.2023.00089(571-578)Online publication date: 18-Aug-2023
https://doi.org/10.1109/DSC59305.2023.00089
Agarwal SDutta SBhattacharya ADemartini GZuccon GCulpepper JHuang ZTong H(2021)VerSaChIProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482217(2812-2816)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482217
Fuller MBrighton ESchiewe MDas DCerny TTisnovsky PHung CHong JBechini ASong E(2021)Automated error log resolutionProceedings of the 36th Annual ACM Symposium on Applied Computing10.1145/3412841.3442004(1298-1304)Online publication date: 22-Mar-2021
https://dl.acm.org/doi/10.1145/3412841.3442004

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.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents