Database Paper Browser

Back to papers

Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions

Summary: Tutorial survey of cohesive subgraph search in heterogeneous information networks (HINs), focusing on models, algorithms, and scalable techniques. Covers applications (community search, recommendations, fraud detection), reviews methods, compares approaches, and outlines open challenges and future directions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6227
Venue
SIGMOD
Year
2021
Pagerank
5.9586508e-05
Overall Rank
4,743 | 67.01%
DOI
10.1145/3448016.3457538

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 26 of 26 cited papers.

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

Rank Cited Paper Year Venue Pagerank
108 Truss Decomposition in Massive Networks 2012 VLDB 0.00048300163
467 Evaluating Probabilistic Queries over Imprecise Data 2003 SIGMOD 0.00022443768
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
999 Effective Community Search for Large Attributed Graphs 2016 VLDB 0.00014726563
1,394 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.0001221552
1,484 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB 0.00011714263
1,550 Approximate Closest Community Search in Networks 2016 VLDB 0.00011423628
1,637 Truss-based Community Search over Large Directed Graphs 2020 SIGMOD 0.0001105259
1,844 Effective Community Search over Large Spatial Graphs 2017 VLDB 0.00010341077
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,909 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 7.9305767e-05
3,273 Global Reinforcement of Social Networks: The Anchored Coreness Problem 2020 SIGMOD 7.2956944e-05
4,344 Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs 2020 SIGMOD 6.2744553e-05
4,394 When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks 2017 VLDB 6.224902e-05
4,459 Efficient Bi-triangle Counting for Large Bipartite Networks 2021 VLDB 6.1651553e-05
4,534 Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice 2020 VLDB 6.1049756e-05
4,728 OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks 2017 VLDB 5.968586e-05
5,035 Scaling Up Distance Labeling on Graphs with Core-Periphery Properties 2020 SIGMOD 5.7470184e-05
5,899 Walking in the Cloud: Parallel SimRank at Scale 2016 VLDB 5.2824488e-05
6,503 Progressive Top-K Nearest Neighbors Search in Large Road Networks 2020 SIGMOD 5.0357715e-05
6,795 Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond 2020 VLDB 4.9242446e-05
6,978 C-Explorer: Browsing Communities in Large Graphs 2017 VLDB 4.8752317e-05
7,346 I/O Efficient ECC Graph Decomposition via Graph Reduction 2016 VLDB 4.7556749e-05
Previous Page 1 / 1 Next

Semantically Similar Papers