Everest: GPU-Accelerated System For Mining Temporal Motifs
Yichao Yuan, Haojie Ye, Sanketh Vedula, Wynn Kaza, Nishil Talati

TL;DR
Everest is a GPU-accelerated system for efficient temporal motif mining in large graphs, significantly reducing runtime and enabling practical applications like fraud detection.
Contribution
The paper introduces Everest, a novel GPU-based system that optimizes temporal motif mining with new execution plans, motif-specific code, load balancing, and multi-GPU support.
Findings
Achieves 19x performance improvement over baseline GPU methods.
Supports large graphs through multi-GPU partitioning.
Handles expressive user-defined temporal motifs.
Abstract
Temporal motif mining is the task of finding the occurrences of subgraph patterns within a large input temporal graph that obey the specified structural and temporal constraints. Despite its utility in several critical application domains that demand high performance (e.g., detecting fraud in financial transaction graphs), the performance of existing software is limited on commercial hardware platforms, in that it runs for tens of hours. This paper presents Everest - a system that efficiently maps the workload of mining (supports both enumeration and counting) temporal motifs to the highly parallel GPU architecture. In particular, using an input temporal graph and a more expressive user-defined temporal motif query definition compared to prior works, Everest generates an execution plan and runtime primitives that optimize the workload execution by exploiting the high compute throughput…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Algorithms and Data Compression · Graph Theory and Algorithms
