Database Paper Browser

Back to papers

Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks

Summary: Efficient enumeration of maximal motif-cliques in large HINs, avoiding exhaustive recursive subgraph exploration that causes duplication and high cost. Proposes an order-based duplicate-avoidance framework, pivot-based pruning, and candidate/subgraph-location optimizations, achieving up to 1,000× speedup on real datasets. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13514
Venue
VLDB
Year
2024
Pagerank
4.4443756e-05
Overall Rank
8,809 | 38.72%
DOI
10.14778/3681954.3681975

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
10,057 Budgeted Strong Community Search in Heterogeneous Graphs 2026 SIGMOD 4.1945683e-05
10,159 Efficient Influential Community Search over Dynamic Graphs 2026 SIGMOD 4.1945683e-05
10,236 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.1945683e-05
10,300 Scalable Approximate Biclique Counting over Large Bipartite Graphs 2026 VLDB 4.1945683e-05
10,535 In-depth Analysis of Densest Subgraph Discovery in a Unified Framework 2025 VLDB 4.1945683e-05
10,670 X-Blossom: Massive Parallelization of Graph Maximum Matching 2025 VLDB 4.1945683e-05
10,681 Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory 2025 VLDB 4.1945683e-05
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
283 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00029041257
589 Massive Graph Triangulation 2013 SIGMOD 0.00019576567
686 Finding Maximal Cliques in Massive Networks by H*-graph 2010 SIGMOD 0.00018178029
768 PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks 2011 VLDB 0.00016919065
891 Maximum Biclique Search at Billion Scale 2020 VLDB 0.00015564292
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,484 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB 0.00011714263
1,740 A General Framework for Estimating Graphlet Statistics via Random Walk 2017 VLDB 0.0001071792
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
2,225 Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs 2021 SIGMOD 9.2479064e-05
2,286 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 9.0982591e-05
2,721 Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks 2020 VLDB 8.2345495e-05
2,903 (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 7.9375744e-05
3,492 Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 7.044442e-05
3,987 COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks 2015 SIGMOD 6.5605514e-05
5,908 Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach 2022 SIGMOD 5.2773278e-05
7,633 Mining Frequent Itemsets over Uncertain Databases 2012 VLDB 4.6914549e-05
11,492 On Analyzing Graphs with Motif-Paths 2021 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
847 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00015993322
5,908 Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach 2022 SIGMOD 5.2773278e-05
2,286 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 9.0982591e-05
5,513 Effective Community Search over Large Star-Schema Heterogeneous Information Networks 2022 VLDB 5.4641695e-05
9,244 Densest Multipartite Subgraph Search in Heterogeneous Information Networks 2024 VLDB 4.3690661e-05
10,553 Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks 2025 VLDB 4.1945683e-05
1,650 Efficient Enumeration of Maximal k-Plexes 2015 SIGMOD 0.00011013428
2,721 Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks 2020 VLDB 8.2345495e-05
686 Finding Maximal Cliques in Massive Networks by H*-graph 2010 SIGMOD 0.00018178029
5,610 Influential Community Search over Large Heterogeneous Information Networks 2023 VLDB 5.4118541e-05