| 616 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00019068362 |
| 858 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00015833075 |
| 888 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015549756 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,181 |
Probabilistic Skylines on Uncertain Data |
2007 |
VLDB |
0.00013447487 |
| 1,202 |
SPARK: Top-k Keyword Query in Relational Databases |
2007 |
SIGMOD |
0.0001333126 |
| 1,232 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints |
2008 |
VLDB |
0.00013133604 |
| 1,392 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012224015 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |
| 1,576 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
0.00011278557 |
| 1,670 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010944596 |
| 1,703 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
0.00010820803 |
| 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,291 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0894835e-05 |
| 2,402 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.87387e-05 |
| 2,440 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.8166939e-05 |
| 2,524 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
8.5993622e-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 |
| 2,913 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9229304e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 3,188 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.4142307e-05 |
| 3,274 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
7.2886717e-05 |
| 3,323 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
7.2170169e-05 |
| 3,456 |
Keyword Search on Structured and Semi-Structured Data |
2009 |
SIGMOD |
7.0756309e-05 |
| 3,461 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.0696567e-05 |
| 3,583 |
Efficient Approximate Entity Extraction with Edit Distance Constraints |
2009 |
SIGMOD |
6.944299e-05 |
| 3,779 |
Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme |
2011 |
SIGMOD |
6.7709545e-05 |
| 3,853 |
Distributed Algorithms on Exact Personalized PageRank |
2017 |
SIGMOD |
6.6987268e-05 |
| 3,857 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6924202e-05 |
| 3,864 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
6.6813849e-05 |
| 4,133 |
On Querying Historical K-Cores |
2021 |
VLDB |
6.4185206e-05 |
| 4,147 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4060893e-05 |
| 4,328 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
6.2765138e-05 |
| 4,341 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.268429e-05 |
| 4,391 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.2190075e-05 |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 4,506 |
Efficiently Answering Top-k Typicality Queries on Large Databases |
2007 |
VLDB |
6.1273675e-05 |
| 4,536 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.099154e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 4,611 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.0438331e-05 |
| 4,727 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
5.9628488e-05 |
| 4,737 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9529218e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7414979e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 5,656 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
5.3876479e-05 |