DBScholar

Back to papers

Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks

Summary: Formalizes meta-subgraph instance search in HINs, retrieving schema-fixed instances directly without embedding enumeration. Develops adjacency-aware AGM bounds and star-based cross-star pruning, achieving up to 100× speedups on large networks. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
h13334bd7763ef741
Venue
SIGMOD
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,456 | 29.73%
DOI
10.1145/3802047
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{chen_sigmod26,
        title = {{Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks}},
        author = {Chen, Lu and Liu, Chengfei and Zhou, Rui and Xu, Jiajie and Li, Jianxin},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802047},
        url = {https://dl.acm.org/doi/10.1145/3802047},
        year = {2026}
}

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 18 of 18 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021236408
489 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017440023
740 PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks 2011 VLDB 0.00014326575
1,224 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB 0.00011458287
1,664 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 9.9394611e-05
2,017 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1788573e-05
2,334 Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks 2020 VLDB 8.6227027e-05
2,743 Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 8.0641715e-05
3,165 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5735255e-05
4,082 Butterfly-Core Community Search over Labeled Graphs 2021 VLDB 6.8146499e-05
4,589 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5130839e-05
4,607 Worst-Case Optimal Graph Joins in Almost No Space 2021 SIGMOD 6.501689e-05
4,780 Influential Community Search over Large Heterogeneous Information Networks 2023 VLDB 6.4161407e-05
4,956 Effective Community Search over Large Star-Schema Heterogeneous Information Networks 2022 VLDB 6.3381425e-05
7,834 Densest Multipartite Subgraph Search in Heterogeneous Information Networks 2024 VLDB 5.4412454e-05
8,185 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.3801229e-05
9,368 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1843659e-05
9,874 Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks 2025 VLDB 5.115241e-05
Previous Page 1 / 1 Next

Semantically Similar Papers