| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 867 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00015792021 |
| 891 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015564292 |
| 1,179 |
Probabilistic Skylines on Uncertain Data |
2007 |
VLDB |
0.00013457451 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,201 |
SPARK: Top-k Keyword Query in Relational Databases |
2007 |
SIGMOD |
0.0001334371 |
| 1,234 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints |
2008 |
VLDB |
0.00013122499 |
| 1,394 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.0001221552 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |
| 1,575 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
0.00011286884 |
| 1,676 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010946423 |
| 1,707 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
0.00010816111 |
| 1,903 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
0.00010155777 |
| 2,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,286 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0982591e-05 |
| 2,409 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.8776858e-05 |
| 2,436 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.8252104e-05 |
| 2,525 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
8.5981082e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 2,801 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.0992955e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 3,129 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.5008242e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 3,273 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
7.2956944e-05 |
| 3,321 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
7.223972e-05 |
| 3,450 |
Keyword Search on Structured and Semi-Structured Data |
2009 |
SIGMOD |
7.0824082e-05 |
| 3,490 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
7.0465856e-05 |
| 3,578 |
Efficient Approximate Entity Extraction with Edit Distance Constraints |
2009 |
SIGMOD |
6.9503858e-05 |
| 3,774 |
Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme |
2011 |
SIGMOD |
6.7757301e-05 |
| 3,854 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6988744e-05 |
| 3,862 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
6.687769e-05 |
| 3,872 |
Distributed Algorithms on Exact Personalized PageRank |
2017 |
SIGMOD |
6.6785582e-05 |
| 4,080 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
6.4652983e-05 |
| 4,139 |
On Querying Historical K-Cores |
2021 |
VLDB |
6.415046e-05 |
| 4,145 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4122551e-05 |
| 4,344 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.2744553e-05 |
| 4,394 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.224902e-05 |
| 4,459 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1651553e-05 |
| 4,504 |
Efficiently Answering Top-k Typicality Queries on Large Databases |
2007 |
VLDB |
6.1327917e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 4,545 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
6.0995026e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 4,728 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
5.968586e-05 |
| 4,743 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9586508e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 5,643 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
5.3928286e-05 |