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,468 | Comprehensive and Efficient Workload Compression | 2021 | VLDB | 6.1584035e-05 |
| 6,366 | ISUM: Efficiently Compressing Large and Complex Workloads for Scalable Index Tuning | 2022 | SIGMOD | 5.0943443e-05 |
| 8,210 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 4.5581054e-05 |
| 9,887 | Graph Exploration: From Users to Large Graphs | 2017 | SIGMOD | 4.2621158e-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 |
|---|---|---|---|---|
| 572 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00019887011 |
| 919 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00015343179 |
| 951 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00015106325 |
| 1,208 | Efficient Diversity-Aware Search | 2011 | SIGMOD | 0.00013275712 |
| 1,445 | Diversifying Top-K Results | 2012 | VLDB | 0.00011945231 |
| 2,000 | DisC Diversity: Result Diversification based on Dissimilarity and Coverage | 2013 | VLDB | 9.8229527e-05 |
| 3,941 | Efficient Diversification of Web Search Results | 2011 | VLDB | 6.6124442e-05 |
| 4,504 | Efficiently Answering Top-k Typicality Queries on Large Databases | 2007 | VLDB | 6.1327917e-05 |
| 12,135 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB | 4.1945683e-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.8887949e-05 |
| 6,801 | Updating Graph Indices with a One-Pass Algorithm | 2015 | SIGMOD | 4.9226813e-05 |
| 212 | Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph | 2019 | VLDB | 0.00033913475 |
| 6,210 | Summarizing Answer Graphs Induced by Keyword Queries | 2013 | VLDB | 5.1560547e-05 |
| 12,111 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD | 4.1945683e-05 |
| 12,135 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB | 4.1945683e-05 |
| 4,504 | Efficiently Answering Top-k Typicality Queries on Large Databases | 2007 | VLDB | 6.1327917e-05 |
| 9,589 | A Graph Method for Keyword-based Selection of the top-K Databases | 2008 | SIGMOD | 4.3209273e-05 |
| 8,505 | Top-K Nearest Keyword Search on Large Graphs | 2013 | VLDB | 4.4958064e-05 |
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |