research-article

Multi-query optimization for subgraph isomorphism search

Authors:

Junhu WangAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 10, Issue 3

Pages 121 - 132

https://doi.org/10.14778/3021924.3021929

Published: 01 November 2016 Publication History

Abstract

Existing work on subgraph isomorphism search mainly focuses on a-query-at-a-time approaches: optimizing and answering each query separately. When multiple queries arrive at the same time, sequential processing is not always the most efficient. In this paper, we study multi-query optimization for subgraph isomorphism search. We first propose a novel method for efficiently detecting useful common sub-graphs and a data structure to organize them. Then we propose a heuristic algorithm based on the data structure to compute a query execution order so that cached intermediate results can be effectively utilized. To balance memory usage and the time for cached results retrieval, we present a novel structure for caching the intermediate results. We provide strategies to revise existing single-query subgraph isomorphism algorithms to seamlessly utilize the cached results, which leads to significant performance improvement. Extensive experiments verified the effectiveness of our solution.

References

[1]

F. Bi, L. Chang, X. Lin, L. Qin, and W. Zhang. Efficient subgraph matching by postponing cartesian products. In SIGMOD, pages 1199--1214, 2016.

Digital Library

[2]

N. Bruno, L. Gravano, N. Koudas, and D. Srivastava. Navigation-vs. index-based XML multi-query processing. In ICDE, pages 139--150, 2003.

[3]

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub) graph isomorphism algorithm for matching large graphs. Pattern Anal. Mach. Intell., IEEE Trans, 26(10):1367--1372, 2004.

Digital Library

[4]

A. Edenbrandt. Quotient tree partitioning of undirected graphs. BIT Numerical Mathematics, 26(2):148--155, 1986.

Digital Library

[5]

W. Fan, Z. Fan, C. Tian, and X. L. Dong. Keys for graphs. PVLDB, 8(12):1590--1601, 2015.

Digital Library

[6]

W. Fan, X. Wang, Y. Wu, and J. Xu. Association rules with graph patterns. PVLDB, 8(12):1502--1513, 2015.

Digital Library

[7]

W. Fan, Y. Wu, and J. Xu. Functional dependencies for graphs. In SIGMOD, pages 1843--1857, 2016.

Digital Library

[8]

S. J. Finkelstein. Common subexpression analysis in database applications. In SIGMOD, pages 235--245, 1982.

Digital Library

[9]

W.-S. Han, J. Lee, and J.-H. Lee. TurboIso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In SIGMOD, pages 337--348, 2013.

Digital Library

[10]

H. He and A. K. Singh. Query language and access methods for graph databases. In Manag. and Min. Graph Data, pages 125--160. 2010.

[11]

M. Hong, A. J. Demers, J. E. Gehrke, C. Koch, M. Riedewald, and W. M. White. Massively multi-query join processing in publish/subscribe systems. In SIGMOD, pages 761--772, 2007.

Digital Library

[12]

H. H. Hung, S. S. Bhowmick, B. Q. Truong, B. Choi, and S. Zhou. Quble: towards blending interactive visual subgraph search queries on large networks. VLDB, pages 401--426, 2014.

Digital Library

[13]

W. Le, A. Kementsietsidis, S. Duan, and F. Li. Scalable multi-query optimization for SPARQL. In ICDE, pages 666--677, 2012.

Digital Library

[14]

J. Lee, W.-S. Han, R. Kasperovics, and J.-H. Lee. An in-depth comparison of subgraph isomorphism algorithms in graph databases. In VLDB, pages 133--144, 2012.

Digital Library

[15]

M. Natarajan. Undertsanding the structure of a drug trafficing organization: a converational analysis. Crime Preventon Studies, 11:273--298, 2000.

[16]

Y. Q and S. SH. Path matching and graph matching in biological networks. J Comput Biol, 14(1):56--67, 2007.

[17]

X. Ren and J. Wang. Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. PVLDB, 8(5):617--628, 2015.

Digital Library

[18]

T. Sellis and S. Ghosh. On the multiple-query optimization problem. TKDE, (2):262--266, 1990.

Digital Library

[19]

T. K. Sellis. Multiple-query optimization. TODS, 13(1):23--52, 1988.

Digital Library

[20]

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

Digital Library

[21]

Z. Sun, H. Wang, H. Wang, B. Shao, and J. Li. Efficient subgraph matching on billion node graphs. PVLDB, 5:788--799, 2012.

Digital Library

[22]

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

Digital Library

[23]

P. Zhao and J. Han. On graph query optimization in large networks. PVLDB, 3:340--351, 2010.

Digital Library

Cited By

Zhao WCao YBuneman PLi JNtarmos N(2024)Automating Vectorized Distributed Graph ComputationProceedings of the ACM on Management of Data10.1145/36988332:6(1-27)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698833
Li JZhao WNtarmos NCao YBuneman P(2023)MITra: A Framework for Multi-Instance Graph TraversalProceedings of the VLDB Endowment10.14778/3603581.360359416:10(2551-2564)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.14778/3603581.3603594
Huang QLai XSu QPan Y(2023)RDF Subgraph Query Based on Common Subgraph in Distributed EnvironmentWireless Communications & Mobile Computing10.1155/2023/71480712023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1155/2023/7148071
Show More Cited By

Multi-query optimization for subgraph isomorphism search
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Subgraph Isomorphism Building on A Hierarchical Query Graph
ICCDA '21: Proceedings of the 2021 5th International Conference on Compute and Data Analysis

Subgraph isomorphism is an essential problem of graph theory. It has broad application on information retrieval in many research field, such as biology, chemistry, knowledge graph and social network. The settlement to graph isomorphism is to find the ...
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., ...
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs

Given two graphs, Subgraph Isomorphism is the problem of deciding whether the first graph (the base graph) contains a subgraph isomorphic to the second one (the pattern graph). This problem is NP-complete even for very restricted graph classes such as ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 10, Issue 3

November 2016

216 pages

ISSN:2150-8097

Editors:
Peter Boncz
CWI
,
Ken Salem
University of Waterloo

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 November 2016

Published in PVLDB Volume 10, Issue 3

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
390
Total Downloads

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

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhao WCao YBuneman PLi JNtarmos N(2024)Automating Vectorized Distributed Graph ComputationProceedings of the ACM on Management of Data10.1145/36988332:6(1-27)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698833
Li JZhao WNtarmos NCao YBuneman P(2023)MITra: A Framework for Multi-Instance Graph TraversalProceedings of the VLDB Endowment10.14778/3603581.360359416:10(2551-2564)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.14778/3603581.3603594
Huang QLai XSu QPan Y(2023)RDF Subgraph Query Based on Common Subgraph in Distributed EnvironmentWireless Communications & Mobile Computing10.1155/2023/71480712023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1155/2023/7148071
Khan A(2023)Knowledge Graphs QueryingACM SIGMOD Record10.1145/3615952.361595652:2(18-29)Online publication date: 10-Aug-2023
https://dl.acm.org/doi/10.1145/3615952.3615956
Peng PJi STian ZJiang HZheng WZhang XSingh ASun YAkoglu LGunopulos DYan XKumar ROzcan FYe J(2023)Locality Sensitive Hashing for Optimizing Subgraph Query Processing in Parallel Computing SystemsProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599419(1885-1896)Online publication date: 6-Aug-2023
https://dl.acm.org/doi/10.1145/3580305.3599419
Long WLi XWang LZhang FLin ZLin X(2023)Efficient m-closest entity matching over heterogeneous information networksKnowledge-Based Systems10.1016/j.knosys.2023.110299263:COnline publication date: 5-Mar-2023
https://dl.acm.org/doi/10.1016/j.knosys.2023.110299
Kim HChoi YPark KLin XHong SHan W(2023)Fast subgraph query processing and subgraph matching via static and dynamic equivalencesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-022-00749-x32:2(343-368)Online publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1007/s00778-022-00749-x
Dexter PLiu YChiu K(2022)The essence of online data processingProceedings of the ACM on Programming Languages10.1145/35633206:OOPSLA2(899-928)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563320
Duong CHoang TYin HWeidlich MNguyen QAberer K(2021)Efficient streaming subgraph isomorphism with graph neural networksProceedings of the VLDB Endowment10.14778/3446095.344609714:5(730-742)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.14778/3446095.3446097
Sun YSarwat M(2021)Riso-Tree: An Efficient and Scalable Index for Spatial Entities in Graph Database Management SystemsACM Transactions on Spatial Algorithms and Systems10.1145/34509457:3(1-39)Online publication date: 16-Jun-2021
https://dl.acm.org/doi/10.1145/3450945
Show More Cited By

View Options

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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents