Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining
Summary: Mayura co-mines temporal motifs by grouping similar motifs into a Motif-Group Tree that reuses common search paths to eliminate redundant computation. Co-mining with a CPU/GPU runtime yields exact counts and average speed-ups of 2.4x (CPU) and 1.7x (GPU) vs per-motif baselines. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Sanjay Sri Vallabh Singapuram (University of Michigan)
- 2. Ronald Dreslinski (University of Michigan)
- 3. Nishil Talati (University of Michigan)
BibTeX Citation
@article{singapuram_vldb25,
title = {{Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining}},
author = {Singapuram, Sanjay Sri Vallabh and Dreslinski, Ronald and Talati, Nishil},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {13},
pages = {5596--5605},
doi = {10.14778/3773731.3773736},
url = {https://doi.org/10.14778/3773731.3773736},
year = {2025}
}
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 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 2 | 11,072 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB |
| 3 | 9,207 | Behavior Query Discovery in System-Generated Temporal Graphs | 2016 | VLDB |
| 4 | 5,266 | Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees | 2022 | VLDB |
| 5 | 2,288 | Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU | 2020 | VLDB |
| 6 | 5,043 | Efficient Temporal Pattern Mining in Big Time Series Using Mutual Information | 2022 | VLDB |
| 7 | 8,871 | MatCo: Computing Match Cover of Subgraph Query over Graph Data | 2025 | SIGMOD |
| 8 | 4,581 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 9 | 10,546 | TIMEST: Temporal Information Motif Estimator Using Sampling Trees | 2026 | VLDB |
| 10 | 11,223 | Everest: GPU-Accelerated System For Mining Temporal Motifs | 2024 | VLDB |