DBScholar

Back to papers

MatCo: Computing Match Cover of Subgraph Query over Graph Data

Summary: MatCo introduces the match-cover problem for subgraph queries and a local candidate space to prune future partial matches, avoiding full exploration. It reduces Cartesian products to linear enumerations and achieves 1–3 orders of magnitude speedups over baselines on diverse graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h06dfe38151bd5740
Venue
SIGMOD
Year
2025
Pagerank
5.2315688e-05
Overall Rank
9,038 | 39.26%
DOI
10.1145/3725323

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{shi_sigmod25,
        title = {{MatCo: Computing Match Cover of Subgraph Query over Graph Data}},
        author = {Shi, Zhichao and Li, Youhuan and Li, Ziming and Dou, Yuequn and Zhong, Xionghu and Zou, Lei},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725323},
        url = {https://dl.acm.org/doi/10.1145/3725323},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,517 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 4.9769913e-05
10,651 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.9769913e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 18 of 18 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
453 Stack-based Algorithms for Pattern Matching on DAGs 2005 VLDB 0.00017963727
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015048943
937 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012971451
961 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012830477
1,046 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012316579
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012007739
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011622165
1,252 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011334813
1,318 Incremental Graph Pattern Matching 2011 SIGMOD 0.00011044781
1,901 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4014537e-05
2,017 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1788573e-05
2,212 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.8195478e-05
3,165 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5735255e-05
3,980 Diversified Top-k Graph Pattern Matching 2013 VLDB 6.87704e-05
4,589 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5130839e-05
4,783 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4133399e-05
5,383 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1533182e-05
5,481 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 6.1126446e-05
Previous Page 1 / 1 Next

Semantically Similar Papers