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
- 2. Xiangyang Gou
- 3. Lei Zou
- 4. Wenjie Zhang
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,270 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 4.1945683e-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 | Pagerank |
|---|---|---|---|---|
| 1,924 | In-Memory Subgraph Matching: An In-depth Study | 2020 | SIGMOD | 0.00010077055 |
| 10,708 | Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences | 2025 | VLDB | 4.1945683e-05 |
| 6,395 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB | 5.0829204e-05 |
| 9,727 | MatCo: Computing Match Cover of Subgraph Query over Graph Data | 2025 | SIGMOD | 4.2942813e-05 |
| 3,036 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB | 7.6735171e-05 |
| 10,084 | GraphMatch: Subgraph Query Processing on Steroids | 2026 | SIGMOD | 4.1945683e-05 |
| 9,556 | Materialized View Selection & View-Based Query Planning for Regular Path Queries | 2024 | SIGMOD | 4.3254416e-05 |
| 11,570 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD | 4.1945683e-05 |
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 3,187 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD | 7.4136521e-05 |