| 439 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism
|
2008 |
VLDB |
0.00018247958 |
| 562 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index
|
2015 |
VLDB |
0.00016344855 |
| 658 |
Efficient Subgraph Matching by Postponing Cartesian Products
|
2016 |
SIGMOD |
0.00015032442 |
| 771 |
Maximum Biclique Search at Billion Scale
|
2020 |
VLDB |
0.00014081924 |
| 934 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints
|
2008 |
VLDB |
0.00012973416 |
| 942 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs
|
2018 |
VLDB |
0.00012936571 |
| 947 |
SPARK: Top-k Keyword Query in Relational Databases
|
2007 |
SIGMOD |
0.00012910239 |
| 1,126 |
Probabilistic Skylines on Uncertain Data
|
2007 |
VLDB |
0.00011888563 |
| 1,227 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks
|
2019 |
VLDB |
0.00011426039 |
| 1,318 |
VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning
|
2020 |
VLDB |
0.00011035606 |
| 1,401 |
Efficient Computation of the Skyline Cube
|
2005 |
VLDB |
0.0001075604 |
| 1,403 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach
|
2008 |
SIGMOD |
0.00010753743 |
| 1,440 |
Speedup Graph Processing by Graph Ordering
|
2016 |
SIGMOD |
0.00010630613 |
| 1,565 |
Scalable Subgraph Enumeration in MapReduce
|
2015 |
VLDB |
0.00010185615 |
| 1,581 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks
|
2018 |
SIGMOD |
0.00010151896 |
| 1,590 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks
|
2020 |
VLDB |
0.00010110798 |
| 1,632 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks
|
2014 |
VLDB |
0.00010005875 |
| 1,711 |
Algorithms for Materialized View Design in Data Warehousing Environment
|
1997 |
VLDB |
9.7964912e-05 |
| 1,907 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
|
2021 |
SIGMOD |
9.379165e-05 |
| 1,995 |
Efficient Algorithms for Densest Subgraph Discovery
|
2019 |
VLDB |
9.2189157e-05 |
| 2,023 |
Scalable Distributed Subgraph Enumeration
|
2017 |
VLDB |
9.1568397e-05 |
| 2,150 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees
|
2020 |
VLDB |
8.9509559e-05 |
| 2,201 |
Scaling Distance Labeling on Small-World Networks
|
2019 |
SIGMOD |
8.8626226e-05 |
| 2,277 |
Data Consistency Properties and the Trade-offs in Commercial Cloud Storages: the Consumers’ Perspective
|
2011 |
CIDR |
8.7010392e-05 |
| 2,338 |
A Scalable Lock Manager for Multicores
|
2013 |
SIGMOD |
8.5997363e-05 |
| 2,339 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs
|
2022 |
VLDB |
8.599495e-05 |
| 2,470 |
Efficient Structural Graph Clustering: An Index-Based Approach
|
2018 |
VLDB |
8.4015437e-05 |
| 2,635 |
Neural Subgraph Counting with Wasserstein Estimator
|
2022 |
SIGMOD |
8.1795762e-05 |
| 2,705 |
TreeSpan: Efficiently Computing Similarity All-Matching
|
2012 |
SIGMOD |
8.0936619e-05 |
| 2,873 |
Hierarchical Core Maintenance on Large Dynamic Graphs
|
2021 |
VLDB |
7.9005874e-05 |
| 2,933 |
Leveraging Set Relations in Exact Set Similarity Join
|
2017 |
VLDB |
7.827041e-05 |
| 3,071 |
Scalable Big Graph Processing in MapReduce
|
2014 |
SIGMOD |
7.6670408e-05 |
| 3,145 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity
|
2015 |
SIGMOD |
7.5828479e-05 |
| 3,170 |
On Querying Historical K-Cores
|
2021 |
VLDB |
7.5572564e-05 |
| 3,239 |
Distributed Algorithms on Exact Personalized PageRank
|
2017 |
SIGMOD |
7.483901e-05 |
| 3,244 |
Similarity Query Processing for High-Dimensional Data
|
2020 |
VLDB |
7.479122e-05 |
| 3,270 |
Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme
|
2011 |
SIGMOD |
7.4613275e-05 |
| 3,323 |
Keyword Search on Structured and Semi-Structured Data
|
2009 |
SIGMOD |
7.4116032e-05 |
| 3,337 |
Sliding-Window Top-k Queries on Uncertain Streams
|
2008 |
VLDB |
7.3950425e-05 |
| 3,366 |
Connected Substructure Similarity Search
|
2010 |
SIGMOD |
7.3548555e-05 |
| 3,396 |
Scaling Up k-Clique Densest Subgraph Detection
|
2023 |
SIGMOD |
7.3277458e-05 |
| 3,522 |
Efficient Approximate Entity Extraction with Edit Distance Constraints
|
2009 |
SIGMOD |
7.2167201e-05 |
| 3,582 |
A Partition-Based Approach to Structure Similarity Search
|
2014 |
VLDB |
7.1715746e-05 |
| 3,778 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
|
2020 |
SIGMOD |
7.0037629e-05 |
| 3,863 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks
|
2017 |
VLDB |
6.9488207e-05 |
| 3,881 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions
|
2021 |
SIGMOD |
6.9309694e-05 |
| 3,885 |
Distributed Subgraph Matching on Timely Dataflow
|
2019 |
VLDB |
6.9282318e-05 |
| 4,057 |
Efficient Bi-triangle Counting for Large Bipartite Networks
|
2021 |
VLDB |
6.8140795e-05 |
| 4,133 |
HUGE: An Efficient and Scalable Subgraph Enumeration System
|
2021 |
SIGMOD |
6.7738028e-05 |
| 4,167 |
Local Similarity Search for Unstructured Text
|
2016 |
SIGMOD |
6.7547438e-05 |