TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database

Summary: Introduces Top-k Edge-Diversified Pattern Discovery, selecting subgraphs that maximize covered database edges rather than returning topologically homogeneous patterns. TED provides a generic approximation-guaranteed framework with optimizations for efficient graph-database processing. (summarized by gpt-5.6-luna on Jul 21 2026)

Paper ID: h4def661e4fa586fd
Venue: SIGMOD
Year: 2023
Pagerank: 5.1966832e-05
Overall Rank: 9,306 | 37.46%
DOI: 10.1145/3588736

Incoming Non-self Citations Over Time

Authors

1. Kai Huang (Hong Kong Polytechnic University; Hong Kong University of Science and Technology)
2. Haibo Hu (Hong Kong Polytechnic University)
3. Qingqing Ye (Hong Kong Polytechnic University)
4. Kai Tian (Tencent)
5. Bolong Zheng (Huazhong University of Science and Technology)
6. Xiaofang Zhou (Hong Kong University of Science and Technology)

BibTeX Citation

@inproceedings{huang_sigmod23,
        title = {{TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database}},
        author = {Huang, Kai and Hu, Haibo and Ye, Qingqing and Tian, Kai and Zheng, Bolong and Zhou, Xiaofang},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3588736},
        url = {https://dl.acm.org/doi/10.1145/3588736},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,064	Aster: Enhancing LSM-structures for Scalable Graph Database	2025	SIGMOD	5.2270607e-05
10,061	Finding Logic Bugs in Graph-processing Systems via Graph-cutting	2025	SIGMOD	5.0851868e-05
10,309	VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines	2023	VLDB	5.0377711e-05

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
475	Sampling Large Databases for Association Rules	1996	VLDB	0.00017665769
1,027	GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph	2014	VLDB	0.00012416665
1,042	Parallel Subgraph Listing in a Large-Scale Graph	2014	SIGMOD	0.00012331317
1,145	Efficient Diversity-Aware Search	2011	SIGMOD	0.00011818487
1,476	Diversifying Top-K Results	2012	VLDB	0.00010546498
1,572	Scalable Subgraph Enumeration in MapReduce	2015	VLDB	0.0001019315
2,013	Mining Significant Graph Patterns by Leap Search	2008	SIGMOD	9.1871245e-05
2,102	DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine	2016	SIGMOD	9.0433983e-05
2,168	Subgraph Matching: on Compression and Computation	2018	VLDB	8.9292584e-05
2,468	GPU-Accelerated Subgraph Enumeration on Partitioned Graphs	2020	SIGMOD	8.4138334e-05
3,980	Diversified Top-k Graph Pattern Matching	2013	VLDB	6.87704e-05
5,481	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	6.1126446e-05
6,126	Exploratory Querying of Extended Knowledge Graphs	2016	VLDB	5.8759899e-05
6,767	Updating Graph Indices with a One-Pass Algorithm	2015	SIGMOD	5.6860336e-05
7,454	PICASSO: Exploratory Search of Connected Subgraph Substructures in Graph Databases	2017	VLDB	5.5212328e-05
8,706	AURORA: Data-driven Construction of Visual Graph Query Interfaces for Graph Databases	2020	SIGMOD	5.2880532e-05
10,310	VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases	2022	VLDB	5.0377711e-05
11,984	MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces	2021	SIGMOD	4.9769913e-05
12,147	CATAPULT: Data-driven Selection of Canned Patterns for Efficient Visual Graph Query Formulation	2019	SIGMOD	4.9769913e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,228	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB
2	10,433	Bound-Tightened Densest Subgraph Discovery on GPU	2026	SIGMOD
3	11,922	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB
4	4,650	Mining Graph Patterns Efficiently via Randomized Summaries	2009	VLDB
5	3,980	Diversified Top-k Graph Pattern Matching	2013	VLDB
6	2,044	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
7	11,062	Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching	2026	VLDB
8	382	TEDI: Efficient Shortest Path Query Answering on Graphs	2010	SIGMOD
9	11,329	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB
10	5,481	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD