| 658 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
75 |
0.00015032442 |
| 1,478 |
Diversifying Top-K Results |
2012 |
VLDB |
19 |
0.00010511781 |
| 1,505 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
15 |
0.00010424285 |
| 1,565 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
38 |
0.00010185615 |
| 1,581 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
35 |
0.00010151896 |
| 1,632 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
17 |
0.00010005875 |
| 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,933 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
14 |
7.827041e-05 |
| 3,000 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
12 |
7.7498183e-05 |
| 3,071 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
9 |
7.6670408e-05 |
| 3,145 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
24 |
7.5828479e-05 |
| 3,431 |
Efficient Size-Bounded Community Search over Large Networks |
2021 |
VLDB |
12 |
7.2925605e-05 |
| 3,591 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
10 |
7.1655231e-05 |
| 4,214 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
16 |
6.7186746e-05 |
| 4,377 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
11 |
6.6166943e-05 |
| 4,567 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
22 |
6.5173666e-05 |
| 4,861 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
11 |
6.3646812e-05 |
| 5,066 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
6 |
6.2786224e-05 |
| 5,409 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
6 |
6.1320768e-05 |
| 5,790 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6 |
5.9762012e-05 |
| 6,073 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8780393e-05 |
| 6,226 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
11 |
5.8266364e-05 |
| 6,813 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
5 |
5.6596752e-05 |
| 6,933 |
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance |
2025 |
VLDB |
3 |
5.6252271e-05 |
| 7,649 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
2 |
5.4598986e-05 |
| 7,769 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4391973e-05 |
| 7,891 |
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition |
2022 |
VLDB |
3 |
5.4156949e-05 |
| 7,915 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
3 |
5.4114919e-05 |
| 9,144 |
Automatic Index Selection for Large-Scale Datalog Computation |
2019 |
VLDB |
3 |
5.2072761e-05 |
| 10,361 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
3 |
5.014328e-05 |
| 10,641 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,719 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,820 |
FB*: A Compact Index for Efficient and Exact Density-based Clustering |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,169 |
A Local Search Approach to Efficient (k, p)-Core Maintenance |
2025 |
SIGMOD |
0 |
4.9605343e-05 |
| 11,255 |
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods |
2025 |
SIGMOD |
0 |
4.9605343e-05 |
| 12,579 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
3 |
4.9605343e-05 |
| 12,801 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
0 |
4.9605343e-05 |