| 438 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00018286607 |
| 562 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00016335405 |
| 766 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00014118259 |
| 937 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012977594 |
| 1,222 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011463714 |
| 1,645 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.9953879e-05 |
| 2,020 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.1729558e-05 |
| 2,141 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.9668034e-05 |
| 2,188 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.8874739e-05 |
| 2,540 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.3274854e-05 |
| 2,634 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.1993804e-05 |
| 2,921 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.8519256e-05 |
| 3,230 |
Similarity Query Processing for High-Dimensional Data |
2020 |
VLDB |
7.5056037e-05 |
| 3,249 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.4939212e-05 |
| 3,369 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
7.3698379e-05 |
| 3,412 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
7.3251247e-05 |
| 3,880 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.9510799e-05 |
| 4,091 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.8124092e-05 |
| 4,422 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6.6060521e-05 |
| 4,488 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.5781787e-05 |
| 4,578 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.5226071e-05 |
| 4,634 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.4933103e-05 |
| 4,745 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.4385742e-05 |
| 5,000 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.3202341e-05 |
| 5,336 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.1747873e-05 |
| 5,803 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5.9893561e-05 |
| 5,998 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
5.9198696e-05 |
| 6,107 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.8852347e-05 |
| 6,177 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
5.8598586e-05 |
| 6,466 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.7751978e-05 |
| 6,495 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5.7658592e-05 |
| 6,775 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
5.685295e-05 |
| 7,076 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5.6061365e-05 |
| 7,377 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.5395908e-05 |
| 7,561 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5.4958573e-05 |
| 7,752 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.4595236e-05 |
| 7,941 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
5.4219572e-05 |
| 8,077 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
5.3942942e-05 |
| 8,420 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
5.3350162e-05 |
| 8,434 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
5.3350162e-05 |
| 8,496 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.3301662e-05 |
| 8,990 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
5.2421474e-05 |
| 9,073 |
Machine Learning for Graph Data Management and Query Processing |
2025 |
VLDB |
5.2283159e-05 |
| 9,525 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
5.1662415e-05 |
| 9,735 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
5.1349531e-05 |
| 9,864 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
5.1176637e-05 |
| 10,127 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
5.0751052e-05 |
| 10,328 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.0333462e-05 |
| 10,600 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,603 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
4.9793485e-05 |