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
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kongzhang Hao
- 2. Longbin Lai
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 454 | An Overview of Query Optimization in Relational Systems | 1998 | PODS | 0.00022734812 |
| 461 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022499343 |
| 506 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00021475362 |
| 612 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.0001920234 |
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 764 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017018712 |
| 4,494 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB | 6.1414196e-05 |
Previous
Page 1 / 1
Next