DBScholar

Back to papers

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)

Paper ID
hd751d6d2b0c2860e
Venue
SIGMOD
Year
2026
Pagerank
5.0415903e-05
Overall Rank
10,300 | 30.75%
DOI
10.1145/3769806

Incoming Non-self Citations Over Time

Authors

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.

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.

Rank Cited Paper Year Venue Pagerank
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026700508
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
540 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.00016726545
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
812 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013729015
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
2,014 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1832045e-05
3,164 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5771124e-05
3,767 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 7.0315534e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
5,233 Implementation Strategies for Views over Property Graphs 2024 SIGMOD 6.2176841e-05
5,377 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1562325e-05
6,504 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.7617085e-05
6,965 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6328006e-05
Previous Page 1 / 1 Next

Semantically Similar Papers