MAVIS: Materialized View for Subgraph Matching
Summary: MAVIS materializes shared subqueries as connected “super-node” patterns, using super-node-oriented materialization to balance memory footprint and processing speed. Tree-based partitioning avoids invalid candidates and a tailored query engine leverages views to accelerate matching. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lisheng Cao (Peking University)
- 2. Xiangyang Gou (University of New South Wales)
- 3. Lei Zou (Peking University)
- 4. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@inproceedings{cao_sigmod26,
title = {{MAVIS: Materialized View for Subgraph Matching}},
author = {Cao, Lisheng and Gou, Xiangyang and Zou, Lei and Zhang, Wenjie},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769806},
url = {https://dl.acm.org/doi/10.1145/3769806},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,558 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 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 | 5,870 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |
| 2 | 8,871 | MatCo: Computing Match Cover of Subgraph Query over Graph Data | 2025 | SIGMOD |
| 3 | 2,035 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 4 | 10,375 | GraphMatch: Subgraph Query Processing on Steroids | 2026 | SIGMOD |
| 5 | 8,975 | Materialized View Selection & View-Based Query Planning for Regular Path Queries | 2024 | SIGMOD |
| 6 | 10,050 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD |
| 7 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 8 | 10,564 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 9 | 2,190 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 10 | 10,204 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD |