DBScholar

Back to papers

cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns

Summary: cuMatch: GPU-based memory-efficient unified worst-case optimal join for subgraph queries with complex patterns (negative/optional edges). single multi-way join prevents intermediate data explosion; new partitioning, scheduling, and task-fusion techniques yield strong memory efficiency and speed, beating prior methods by orders of magnitude. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hb3b3c4f8b57cc9aa
Venue
SIGMOD
Year
2025
Pagerank
4.9605343e-05
Overall Rank
11,270 | 24.46%
DOI
10.1145/3725398
PDF
Download (CC BY-NC 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{park_sigmod25,
        title = {{cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns}},
        author = {Park, Sungwoo and Oh, Seyeon and Kim, Min-Soo},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725398},
        url = {https://dl.acm.org/doi/10.1145/3725398},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 34 of 34 cited papers.

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

Rank Cited Paper Year Venue Pagerank
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024929198
235 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00023701614
318 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021178303
375 Umbra: A Disk-Based System with In-Memory Performance 2020 CIDR 0.00019660459
397 Worst-case Optimal Join Algorithms 2012 PODS 0.0001911958
440 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018235529
467 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017740891
658 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015032442
702 Database Architecture Evolution: Mammals Flourished long before Dinosaurs became Extinct 2009 VLDB 0.0001464107
706 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014622696
942 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012936571
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,090 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012062682
1,253 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011316982
1,296 From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System 2015 SIGMOD 0.00011119184
1,530 Pipelined Query Processing in Coprocessor Environments 2018 SIGMOD 0.00010318943
1,603 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 0.00010090639
1,764 Kuzu* Graph Database Management System 2023 CIDR 9.6923285e-05
1,879 Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs 2014 VLDB 9.4293777e-05
1,988 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2301018e-05
2,128 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9879343e-05
2,273 NeutronStar: Distributed GNN Training with Hybrid Dependency Management 2022 SIGMOD 8.7079974e-05
2,478 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.3890338e-05
3,020 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7267183e-05
3,107 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6265309e-05
3,316 A Distributed Multi-GPU System for Fast Graph Processing 2018 VLDB 7.415249e-05
3,796 GTS: A Fast and Scalable Graph Processing Method based on Streaming Topology to GPUs 2016 SIGMOD 6.9956706e-05
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-05
4,300 TurboGraph++: A Scalable and Fast Graph Analytics System 2018 SIGMOD 6.6633635e-05
4,370 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6213567e-05
4,650 Improving Execution Efficiency of Just-in-time Compilation based Query Processing on GPUs 2021 VLDB 6.471543e-05
4,922 TrillionG: A Trillion-scale Synthetic Graph Generator using a Recursive Vector Model 2017 SIGMOD 6.3430793e-05
5,034 Free Join: Unifying Worst-Case Optimal and Traditional Joins 2023 SIGMOD 6.2921115e-05
8,517 SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries 2020 SIGMOD 5.3110227e-05
Previous Page 1 / 1 Next

Semantically Similar Papers