| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,445 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00011945231 |
| 1,564 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00011350495 |
| 1,903 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.00010155777 |
| 2,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,436 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.8252104e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 2,801 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.0992955e-05 |
| 3,129 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.5008242e-05 |
| 3,490 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.0465856e-05 |
| 3,854 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6988744e-05 |
| 3,969 |
Efficient Size-Bounded Community Search over Large Networks |
2021 |
VLDB |
6.5787567e-05 |
| 4,081 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
6.4642761e-05 |
| 4,984 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
5.7867286e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 5,355 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
5.5517073e-05 |
| 5,643 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
5.3928286e-05 |
| 5,696 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
5.3673968e-05 |
| 5,751 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.3409543e-05 |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 6,503 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0357715e-05 |
| 7,346 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7556749e-05 |
| 7,673 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
4.6826056e-05 |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6598957e-05 |
| 7,762 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6583829e-05 |
| 8,256 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.5490743e-05 |
| 8,630 |
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition |
2022 |
VLDB |
4.480887e-05 |
| 8,994 |
Automatic Index Selection for Large-Scale Datalog Computation |
2019 |
VLDB |
4.4129398e-05 |
| 9,396 |
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance |
2025 |
VLDB |
4.3441378e-05 |
| 9,406 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
4.3441378e-05 |
| 9,952 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
4.2405999e-05 |
| 10,078 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,171 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,363 |
A Local Search Approach to Efficient (k, p)-Core Maintenance |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,487 |
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods |
2025 |
SIGMOD |
4.1945683e-05 |
| 12,041 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
4.1945683e-05 |
| 12,266 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
4.1945683e-05 |