| 439 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
72 |
0.00018247958 |
| 562 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
48 |
0.00016344855 |
| 771 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
29 |
0.00014081924 |
| 942 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
58 |
0.00012936571 |
| 1,227 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
32 |
0.00011426039 |
| 1,581 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
35 |
0.00010151896 |
| 2,023 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
33 |
9.1568397e-05 |
| 2,150 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
19 |
8.9509559e-05 |
| 2,201 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
23 |
8.8626226e-05 |
| 2,470 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
14 |
8.4015437e-05 |
| 2,635 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
20 |
8.1795762e-05 |
| 2,933 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
14 |
7.827041e-05 |
| 3,170 |
On Querying Historical K-Cores |
2021 |
VLDB |
23 |
7.5572564e-05 |
| 3,244 |
Similarity Query Processing for High-Dimensional Data |
2020 |
VLDB |
14 |
7.479122e-05 |
| 3,366 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
9 |
7.3548555e-05 |
| 3,396 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
10 |
7.3277458e-05 |
| 3,863 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
14 |
6.9488207e-05 |
| 3,885 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
28 |
6.9282318e-05 |
| 4,180 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
7 |
6.7474268e-05 |
| 4,214 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
16 |
6.7186746e-05 |
| 4,597 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
11 |
6.4979622e-05 |
| 4,658 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
14 |
6.468776e-05 |
| 4,767 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
5 |
6.4142464e-05 |
| 5,026 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
13 |
6.2965202e-05 |
| 5,357 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
7 |
6.1514562e-05 |
| 5,409 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
6 |
6.1320768e-05 |
| 6,002 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
12 |
5.9028394e-05 |
| 6,073 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8780393e-05 |
| 6,192 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
13 |
5.8377174e-05 |
| 6,465 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5 |
5.7596353e-05 |
| 6,511 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5 |
5.7440732e-05 |
| 6,795 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
7 |
5.6638135e-05 |
| 7,087 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5 |
5.5882877e-05 |
| 7,399 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
6 |
5.5186598e-05 |
| 7,581 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5 |
5.4753678e-05 |
| 7,769 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4391973e-05 |
| 7,960 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
3 |
5.4014706e-05 |
| 8,102 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
3 |
5.3739121e-05 |
| 8,395 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
9 |
5.3240312e-05 |
| 8,445 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
2 |
5.3148581e-05 |
| 8,459 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
1 |
5.3148581e-05 |
| 8,519 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
6 |
5.3100264e-05 |
| 9,103 |
Machine Learning for Graph Data Management and Query Processing |
2025 |
VLDB |
1 |
5.208561e-05 |
| 9,188 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
4 |
5.1975376e-05 |
| 9,451 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
2 |
5.1613384e-05 |
| 9,772 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
2 |
5.115551e-05 |
| 10,168 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
2 |
5.0559291e-05 |
| 10,361 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
3 |
5.014328e-05 |
| 10,379 |
Algebraic Subgraph Counting |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,381 |
Approximating Contribution in Misinformation Mitigation |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,672 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 10,675 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 10,706 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 11,136 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,182 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9605343e-05 |
| 11,349 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
3 |
4.9605343e-05 |
| 11,504 |
Efficient Computation of Hyper-triangles on Hypergraphs |
2025 |
VLDB |
2 |
4.9605343e-05 |
| 11,578 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
1 |
4.9605343e-05 |
| 11,595 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9605343e-05 |
| 11,601 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
2 |
4.9605343e-05 |
| 11,648 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
4 |
4.9605343e-05 |
| 11,653 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
0 |
4.9605343e-05 |