Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query
Summary: Vertex-constrained Multi Subgraph Matching Query (vMSQ) scheduling for parallel processing of multiple subgraph queries. Proposes a load-balanced, computation-sharing aware schedule to maximize cross-query reuse of subgraph matches during graph pattern matching. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kongzhang Hao (University of New South Wales)
- 2. Longbin Lai (Alibaba)
BibTeX Citation
@inproceedings{hao_sigmod20,
title = {{Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query}},
author = {Hao, Kongzhang and Lai, Longbin},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3384409},
url = {https://dl.acm.org/doi/10.1145/3318464.3384409},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,204 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 290 | An Overview of Query Optimization in Relational Systems | 1998 | PODS | 0.0002227038 |
| 294 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022253507 |
| 352 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00020375193 |
| 431 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00018577017 |
| 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018398144 |
| 485 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017717377 |
| 3,709 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB | 7.1780227e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,035 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 2 | 1,246 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 3 | 10,564 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 4 | 659 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 5 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 6 | 2,190 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 7 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 8 | 3,709 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 9 | 10,204 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD |
| 10 | 10,558 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB |