Everest: GPU-Accelerated System For Mining Temporal Motifs
Summary: Everest compiles expressive temporal-motif queries into GPU-specialized plans for enumeration and counting, reducing memory latency and divergence. Load balancing and communication-free multi-GPU partitioning yield a 19× average speedup over a GPU baseline. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yichao Yuan (University of Michigan)
- 2. Haojie Ye (University of Michigan)
- 3. Sanketh Vedula (Technion)
- 4. Wynn Kaza (University of Michigan)
- 5. Nishil Talati (University of Michigan)
BibTeX Citation
@article{yuan_vldb24,
title = {{Everest: GPU-Accelerated System For Mining Temporal Motifs}},
author = {Yuan, Yichao and Ye, Haojie and Vedula, Sanketh and Kaza, Wynn and Talati, Nishil},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {2},
pages = {162--174},
doi = {10.14778/3626292.3626299},
url = {https://doi.org/10.14778/3626292.3626299},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,728 | TIMEST: Temporal Information Motif Estimator Using Sampling Trees | 2026 | VLDB | 4.9793485e-05 |
| 10,871 | Efficient GPU-Accelerated Adaptive Minimum Cost Seed Selection | 2026 | VLDB | 4.9793485e-05 |
| 11,431 | Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,469 | Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU | 2020 | VLDB | 8.4165523e-05 |
| 4,009 | 2SCENT: An Efficient Algorithm for Enumerating All Simple Temporal Cycles | 2018 | VLDB | 6.8584055e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,207 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD |
| 2 | 3,314 | Accelerating Triangle Counting on GPU | 2021 | SIGMOD |
| 3 | 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB |
| 4 | 4,099 | Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining | 2011 | VLDB |
| 5 | 10,746 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 6 | 2,469 | Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU | 2020 | VLDB |
| 7 | 10,728 | TIMEST: Temporal Information Motif Estimator Using Sampling Trees | 2026 | VLDB |
| 8 | 2,468 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD |
| 9 | 4,237 | Accelerating Dynamic Graph Analytics on GPUs | 2018 | VLDB |
| 10 | 11,431 | Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining | 2025 | VLDB |