| 659 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
74 |
0.00015048943 |
| 1,476 |
Diversifying Top-K Results |
2012 |
VLDB |
19 |
0.00010546498 |
| 1,501 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
15 |
0.00010456517 |
| 1,572 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
38 |
0.0001019315 |
| 1,626 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
17 |
0.00010039008 |
| 1,645 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
34 |
9.9906562e-05 |
| 2,022 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
32 |
9.1686153e-05 |
| 2,143 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
19 |
8.9625587e-05 |
| 2,190 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
23 |
8.8832666e-05 |
| 2,540 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
13 |
8.3235433e-05 |
| 2,923 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
14 |
7.8482459e-05 |
| 3,068 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
9 |
7.6841028e-05 |
| 3,190 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
11 |
7.5493022e-05 |
| 3,329 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
22 |
7.4158814e-05 |
| 3,444 |
Efficient Size-Bounded Community Search over Large Networks |
2021 |
VLDB |
12 |
7.2931726e-05 |
| 3,861 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
9 |
6.9630685e-05 |
| 4,359 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
11 |
6.6371259e-05 |
| 4,491 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
15 |
6.5750647e-05 |
| 5,268 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
9 |
6.2008992e-05 |
| 5,586 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
5 |
6.0732255e-05 |
| 5,664 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
19 |
6.0444315e-05 |
| 5,784 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6 |
5.9944071e-05 |
| 5,804 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5 |
5.9865208e-05 |
| 6,087 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8890302e-05 |
| 6,214 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
11 |
5.8459668e-05 |
| 6,916 |
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance |
2025 |
VLDB |
3 |
5.6438893e-05 |
| 7,640 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
2 |
5.4766381e-05 |
| 7,756 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4570169e-05 |
| 7,783 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
4 |
5.4522248e-05 |
| 7,898 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
3 |
5.429445e-05 |
| 8,780 |
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition |
2022 |
VLDB |
2 |
5.278131e-05 |
| 9,125 |
Automatic Index Selection for Large-Scale Datalog Computation |
2019 |
VLDB |
3 |
5.2245517e-05 |
| 10,335 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
3 |
5.0309635e-05 |
| 10,578 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,658 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,759 |
FB*: A Compact Index for Efficient and Exact Density-based Clustering |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,108 |
A Local Search Approach to Efficient (k, p)-Core Maintenance |
2025 |
SIGMOD |
0 |
4.9769913e-05 |
| 11,196 |
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods |
2025 |
SIGMOD |
0 |
4.9769913e-05 |
| 12,536 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
3 |
4.9769913e-05 |
| 12,758 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
0 |
4.9769913e-05 |