| 659 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00015214062 |
| 1,454 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00010739504 |
| 1,552 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010379532 |
| 1,555 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00010370683 |
| 1,588 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.0001026895 |
| 1,613 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
0.00010216983 |
| 2,065 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.2352771e-05 |
| 2,097 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
9.1725037e-05 |
| 2,152 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
9.0778596e-05 |
| 2,482 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.5183361e-05 |
| 3,008 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.8578871e-05 |
| 3,040 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.8262287e-05 |
| 3,261 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.5853837e-05 |
| 3,395 |
Efficient Size-Bounded Community Search over Large Networks |
2021 |
VLDB |
7.44939e-05 |
| 3,831 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
7.0862742e-05 |
| 4,403 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.7229209e-05 |
| 4,554 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
6.6345929e-05 |
| 4,672 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
6.5731244e-05 |
| 5,149 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
6.3459884e-05 |
| 5,471 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
6.2061433e-05 |
| 5,540 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
6.1809407e-05 |
| 5,678 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
6.1246854e-05 |
| 5,797 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6.0859157e-05 |
| 5,987 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
6.0183678e-05 |
| 6,535 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.8486743e-05 |
| 7,664 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.5720259e-05 |
| 7,731 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
5.5566938e-05 |
| 7,764 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
5.5499989e-05 |
| 8,623 |
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition |
2022 |
VLDB |
5.3984824e-05 |
| 8,982 |
Automatic Index Selection for Large-Scale Datalog Computation |
2019 |
VLDB |
5.3397715e-05 |
| 9,548 |
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance |
2025 |
VLDB |
5.2528121e-05 |
| 9,558 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
5.2528121e-05 |
| 10,101 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.1488731e-05 |
| 10,369 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
5.093636e-05 |
| 10,460 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
5.093636e-05 |
| 10,567 |
FB*: A Compact Index for Efficient and Exact Density-based Clustering |
2026 |
VLDB |
5.093636e-05 |
| 10,656 |
A Local Search Approach to Efficient (k, p)-Core Maintenance |
2025 |
SIGMOD |
5.093636e-05 |
| 10,764 |
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods |
2025 |
SIGMOD |
5.093636e-05 |
| 12,239 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
5.093636e-05 |
| 12,461 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
5.093636e-05 |