Answering Top-k Representative Queries on Graph Databases
Summary: Top-k representative queries on graph databases; cast as Set Cover, solved by a greedy algorithm with provable approximation guarantees. NB-Index indexes theta-neighborhoods via Lipschitz embedding and agglomerative clustering, delivering up to two orders of magnitude speedups on real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sayan Ranu
- 2. Minh Hoang
- 3. Ambuj Singh
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,469 | Comprehensive and Efficient Workload Compression | 2021 | VLDB | 6.1535623e-05 |
| 6,364 | ISUM: Efficiently Compressing Large and Complex Workloads for Scalable Index Tuning | 2022 | SIGMOD | 5.0895007e-05 |
| 8,209 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 4.5537353e-05 |
| 9,886 | Graph Exploration: From Users to Large Graphs | 2017 | SIGMOD | 4.2580321e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 576 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00019858777 |
| 916 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00015326675 |
| 949 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.0001510288 |
| 1,204 | Efficient Diversity-Aware Search | 2011 | SIGMOD | 0.00013316893 |
| 1,435 | Diversifying Top-K Results | 2012 | VLDB | 0.00011981694 |
| 1,984 | DisC Diversity: Result Diversification based on Dissimilarity and Coverage | 2013 | VLDB | 9.8645751e-05 |
| 3,942 | Efficient Diversification of Web Search Results | 2011 | VLDB | 6.6072828e-05 |
| 4,506 | Efficiently Answering Top-k Typicality Queries on Large Databases | 2007 | VLDB | 6.1273675e-05 |
| 12,143 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,838 | Finding Patterns in a Knowledge Base using Keywords to Compose Table Answers | 2014 | VLDB | 5.883146e-05 |
| 6,870 | Updating Graph Indices with a One-Pass Algorithm | 2015 | SIGMOD | 4.8974284e-05 |
| 210 | Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph | 2019 | VLDB | 0.00034086264 |
| 6,208 | Summarizing Answer Graphs Induced by Keyword Queries | 2013 | VLDB | 5.1511024e-05 |
| 12,119 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD | 4.1905499e-05 |
| 12,143 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB | 4.1905499e-05 |
| 4,506 | Efficiently Answering Top-k Typicality Queries on Large Databases | 2007 | VLDB | 6.1273675e-05 |
| 9,589 | A Graph Method for Keyword-based Selection of the top-K Databases | 2008 | SIGMOD | 4.3167828e-05 |
| 8,504 | Top-K Nearest Keyword Search on Large Graphs | 2013 | VLDB | 4.491551e-05 |
| 5,903 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.2757528e-05 |