Mining Top-K Large Structural Patterns in a Massive Network

Summary: SpiderMine mines top-K patterns in a network with probability 1-ε. Abandoning edge-by-edge growth, it uses bounded-diameter spiders and a probabilistic framework to prune growth, trim combinatorics, and speed isomorphism via a multi-set spider encoding. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h119416ca502336dc
Venue: VLDB
Year: 2011
Pagerank: 6.6264137e-05
Overall Rank: 4,363 | 70.76%
DOI: 10.14778/3402707.3402720

Incoming Non-self Citations Over Time

Authors

1. Feida Zhu (Singapore Management University)
2. Qiang Qu (Peking University)
3. David Lo (Singapore Management University)
4. Xifeng Yan (University of California at Santa-Barbara)
5. Jiawei Han (University of Illinois Urbana-Champaign)
6. Philip S. Yu (University of Illinois Chicago)

BibTeX Citation

@article{zhu_vldb11,
        title = {{Mining Top-K Large Structural Patterns in a Massive Network}},
        author = {Zhu, Feida and Qu, Qiang and Lo, David and Yan, Xifeng and Han, Jiawei and Yu, Philip S.},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {4},
        number = {11},
        pages = {807--818},
        doi = {10.14778/3402707.3402720},
        url = {https://doi.org/10.14778/3402707.3402720},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
440	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018235529
1,417	A Distributed Graph Engine for Web Scale RDF Data	2013	VLDB	0.00010706533
12,109	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD	4.9605343e-05
12,581	A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery	2013	SIGMOD	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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.00026634326
333	FG-Index: Towards Verification-Free Query Processing on Graph Databases	2007	SIGMOD	0.00020712452
2,022	Mining Significant Graph Patterns by Leap Search	2008	SIGMOD	9.1569678e-05
2,134	Generating Example Data for Dataflow Programs	2009	SIGMOD	8.9819242e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	14,016	Managing and Mining Large Graphs: Patterns and Algorithms	2012	SIGMOD
2	5,744	Output Space Sampling for Graph Patterns	2009	VLDB
3	2,022	Mining Significant Graph Patterns by Leap Search	2008	SIGMOD
4	2,771	GraphMiner: A Structural Pattern-Mining System for Large Disk-based Graph Databases and Its Applications	2005	SIGMOD
5	130	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB
6	5,499	Towards Proximity Pattern Mining in Large Graphs	2010	SIGMOD
7	8,358	Mining Top-k Pairs of Correlated Subgraphs in a Large Network	2020	VLDB
8	4,666	Mining Graph Patterns Efficiently via Randomized Summaries	2009	VLDB
9	7,629	Mining Attribute-structure Correlated Patterns in Large Attributed Graphs	2012	VLDB
10	4,323	On Dense Pattern Mining in Graph Streams	2010	VLDB