| 431 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00018577017 |
| 580 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00016157635 |
| 659 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00015214062 |
| 780 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00014091815 |
| 911 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints |
2008 |
VLDB |
0.00013283031 |
| 927 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00013161079 |
| 930 |
SPARK: Top-k Keyword Query in Relational Databases |
2007 |
SIGMOD |
0.0001312728 |
| 1,097 |
Probabilistic Skylines on Uncertain Data |
2007 |
VLDB |
0.00012181027 |
| 1,211 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011648789 |
| 1,360 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
0.00011040203 |
| 1,363 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
0.00011025316 |
| 1,511 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010538011 |
| 1,552 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010379532 |
| 1,588 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.0001026895 |
| 1,613 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
0.00010216983 |
| 1,647 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
0.00010125633 |
| 2,024 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
9.2907829e-05 |
| 2,065 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.2352771e-05 |
| 2,097 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
9.1725037e-05 |
| 2,152 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
9.0778596e-05 |
| 2,190 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
8.9804702e-05 |
| 2,482 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.5183361e-05 |
| 2,650 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.2920414e-05 |
| 2,826 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
8.0865974e-05 |
| 3,008 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.8578871e-05 |
| 3,040 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.8262287e-05 |
| 3,193 |
Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme |
2011 |
SIGMOD |
7.649474e-05 |
| 3,239 |
Keyword Search on Structured and Semi-Structured Data |
2009 |
SIGMOD |
7.6078324e-05 |
| 3,261 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.5853837e-05 |
| 3,311 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
7.5353184e-05 |
| 3,312 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.5309892e-05 |
| 3,315 |
Distributed Algorithms on Exact Personalized PageRank |
2017 |
SIGMOD |
7.5274958e-05 |
| 3,446 |
Efficient Approximate Entity Extraction with Edit Distance Constraints |
2009 |
SIGMOD |
7.4087786e-05 |
| 3,522 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
7.3491042e-05 |
| 3,599 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
7.2710351e-05 |
| 3,613 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
7.2572837e-05 |
| 3,737 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
7.1609645e-05 |
| 3,821 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
7.0933895e-05 |
| 3,997 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.9679551e-05 |
| 4,008 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.9619668e-05 |
| 4,158 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.8628196e-05 |
| 4,321 |
Efficiently Answering Top-k Typicality Queries on Large Databases |
2007 |
VLDB |
6.7617825e-05 |
| 4,331 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6.7561061e-05 |
| 4,403 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.7229209e-05 |
| 4,485 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.6715036e-05 |
| 4,551 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.6355948e-05 |
| 4,579 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
6.6203846e-05 |
| 4,650 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.5863543e-05 |
| 4,983 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
6.4127092e-05 |
| 5,044 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.3883109e-05 |