| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,435 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00011981694 |
| 1,564 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00011340407 |
| 1,896 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.00010173473 |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 2,440 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.8166939e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5600506e-05 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 3,188 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.4142307e-05 |
| 3,461 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.0696567e-05 |
| 3,857 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6924202e-05 |
| 3,972 |
Efficient Size-Bounded Community Search over Large Networks |
2021 |
VLDB |
6.5724209e-05 |
| 4,085 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
6.4580586e-05 |
| 4,984 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
5.7811667e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7414979e-05 |
| 5,365 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
5.5463723e-05 |
| 5,656 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
5.3876479e-05 |
| 5,709 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
5.3622436e-05 |
| 5,764 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.3358197e-05 |
| 6,206 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1522897e-05 |
| 6,497 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0324877e-05 |
| 7,343 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7511136e-05 |
| 7,664 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
4.6805647e-05 |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6554272e-05 |
| 7,761 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6543114e-05 |
| 8,252 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.544713e-05 |
| 8,630 |
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition |
2022 |
VLDB |
4.4765914e-05 |
| 9,000 |
Automatic Index Selection for Large-Scale Datalog Computation |
2019 |
VLDB |
4.4087102e-05 |
| 9,402 |
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance |
2025 |
VLDB |
4.3399748e-05 |
| 9,412 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
4.3399748e-05 |
| 9,951 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
4.236537e-05 |
| 10,078 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,171 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,280 |
FB*: A Compact Index for Efficient and Exact Density-based Clustering |
2026 |
VLDB |
4.1905499e-05 |
| 10,375 |
A Local Search Approach to Efficient (k, p)-Core Maintenance |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,497 |
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods |
2025 |
SIGMOD |
4.1905499e-05 |
| 12,049 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
4.1905499e-05 |
| 12,274 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
4.1905499e-05 |