| 438 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00018286607 |
| 562 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00016335405 |
| 657 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.0001505607 |
| 766 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00014118259 |
| 929 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints |
2008 |
VLDB |
0.00013020115 |
| 937 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012977594 |
| 942 |
SPARK: Top-k Keyword Query in Relational Databases |
2007 |
SIGMOD |
0.00012956137 |
| 1,124 |
Probabilistic Skylines on Uncertain Data |
2007 |
VLDB |
0.00011927351 |
| 1,222 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011463714 |
| 1,394 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
0.00010796403 |
| 1,396 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
0.0001079253 |
| 1,440 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010641888 |
| 1,572 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010197978 |
| 1,626 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.00010043754 |
| 1,645 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.9953879e-05 |
| 1,663 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.9441685e-05 |
| 1,900 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
9.4059063e-05 |
| 2,020 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.1729558e-05 |
| 2,042 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
9.1416822e-05 |
| 2,141 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.9668034e-05 |
| 2,188 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.8874739e-05 |
| 2,540 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.3274854e-05 |
| 2,702 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.1177147e-05 |
| 2,869 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
7.9235321e-05 |
| 2,921 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.8519256e-05 |
| 3,066 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.6877117e-05 |
| 3,249 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.4939212e-05 |
| 3,255 |
Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme |
2011 |
SIGMOD |
7.4890984e-05 |
| 3,266 |
Distributed Algorithms on Exact Personalized PageRank |
2017 |
SIGMOD |
7.4775e-05 |
| 3,312 |
Keyword Search on Structured and Semi-Structured Data |
2009 |
SIGMOD |
7.4385614e-05 |
| 3,326 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
7.4227632e-05 |
| 3,328 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.4193937e-05 |
| 3,369 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
7.3698379e-05 |
| 3,412 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
7.3251247e-05 |
| 3,512 |
Efficient Approximate Entity Extraction with Edit Distance Constraints |
2009 |
SIGMOD |
7.2439455e-05 |
| 3,569 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
7.1987748e-05 |
| 3,789 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
7.0191274e-05 |
| 3,875 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
6.9536357e-05 |
| 3,880 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.9510799e-05 |
| 4,044 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.8334494e-05 |
| 4,075 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
6.8188389e-05 |
| 4,091 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.8124092e-05 |
| 4,123 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.7927568e-05 |
| 4,408 |
Efficiently Answering Top-k Typicality Queries on Large Databases |
2007 |
VLDB |
6.6122752e-05 |
| 4,422 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6.6060521e-05 |
| 4,488 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.5781787e-05 |
| 4,578 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
6.5226071e-05 |
| 4,634 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.4933103e-05 |
| 4,745 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.4385742e-05 |
| 5,000 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.3202341e-05 |