| 438 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
71 |
0.00018278591 |
| 562 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
48 |
0.00016350316 |
| 659 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
74 |
0.00015048943 |
| 766 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
29 |
0.00014111575 |
| 929 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints |
2008 |
VLDB |
37 |
0.00013014029 |
| 937 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
57 |
0.00012971451 |
| 942 |
SPARK: Top-k Keyword Query in Relational Databases |
2007 |
SIGMOD |
32 |
0.00012950177 |
| 1,125 |
Probabilistic Skylines on Uncertain Data |
2007 |
VLDB |
28 |
0.00011921893 |
| 1,224 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
32 |
0.00011458287 |
| 1,395 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
18 |
0.00010791312 |
| 1,397 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
26 |
0.00010787659 |
| 1,438 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
25 |
0.00010647473 |
| 1,572 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
38 |
0.0001019315 |
| 1,626 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
17 |
0.00010039008 |
| 1,645 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
34 |
9.9906562e-05 |
| 1,664 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
39 |
9.9394611e-05 |
| 1,901 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
41 |
9.4014537e-05 |
| 2,022 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
32 |
9.1686153e-05 |
| 2,044 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
39 |
9.1373547e-05 |
| 2,143 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
19 |
8.9625587e-05 |
| 2,190 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
23 |
8.8832666e-05 |
| 2,540 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
13 |
8.3235433e-05 |
| 2,701 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
15 |
8.114832e-05 |
| 2,869 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
13 |
7.9197812e-05 |
| 2,923 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
14 |
7.8482459e-05 |
| 3,068 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
9 |
7.6841028e-05 |
| 3,251 |
On Querying Historical K-Cores |
2021 |
VLDB |
22 |
7.4903737e-05 |
| 3,256 |
Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme |
2011 |
SIGMOD |
18 |
7.4855571e-05 |
| 3,267 |
Distributed Algorithms on Exact Personalized PageRank |
2017 |
SIGMOD |
9 |
7.4739604e-05 |
| 3,313 |
Keyword Search on Structured and Semi-Structured Data |
2009 |
SIGMOD |
9 |
7.4350441e-05 |
| 3,328 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
9 |
7.4194442e-05 |
| 3,329 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
22 |
7.4158814e-05 |
| 3,369 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
9 |
7.3663492e-05 |
| 3,412 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
10 |
7.321657e-05 |
| 3,512 |
Efficient Approximate Entity Extraction with Edit Distance Constraints |
2009 |
SIGMOD |
14 |
7.2405277e-05 |
| 3,570 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
8 |
7.195367e-05 |
| 3,791 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
26 |
7.0158046e-05 |
| 3,875 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
11 |
6.9503439e-05 |
| 3,881 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
28 |
6.9477894e-05 |
| 4,045 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
12 |
6.8302145e-05 |
| 4,077 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
22 |
6.8156109e-05 |
| 4,095 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
13 |
6.8091843e-05 |
| 4,124 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
26 |
6.7895411e-05 |
| 4,409 |
Efficiently Answering Top-k Typicality Queries on Large Databases |
2007 |
VLDB |
6 |
6.609155e-05 |
| 4,424 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6 |
6.6029248e-05 |
| 4,491 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
15 |
6.5750647e-05 |
| 4,580 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
11 |
6.5195194e-05 |
| 4,637 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
14 |
6.4902365e-05 |
| 4,748 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
5 |
6.4355262e-05 |
| 5,004 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
13 |
6.3172422e-05 |
| 5,268 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
9 |
6.2008992e-05 |
| 5,664 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
19 |
6.0444315e-05 |
| 5,784 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6 |
5.9944071e-05 |
| 6,000 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
12 |
5.9170672e-05 |
| 6,073 |
Efficient Processing of XML Path Queries Using the Disk-based F&B Index |
2005 |
VLDB |
4 |
5.8935926e-05 |
| 6,087 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8890302e-05 |
| 6,180 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
13 |
5.8570846e-05 |
| 6,205 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
8 |
5.8483206e-05 |
| 6,214 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
11 |
5.8459668e-05 |
| 6,468 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5 |
5.7724639e-05 |
| 6,497 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5 |
5.7631297e-05 |
| 6,780 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
7 |
5.6826037e-05 |
| 7,077 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5 |
5.6034826e-05 |
| 7,433 |
Demand-Aware Route Planning for Shared Mobility Services |
2020 |
VLDB |
2 |
5.5272253e-05 |
| 7,567 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5 |
5.4933119e-05 |
| 7,706 |
VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search |
2025 |
VLDB |
5 |
5.4724414e-05 |
| 7,756 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4570169e-05 |
| 7,945 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
3 |
5.4193905e-05 |
| 8,175 |
Efficient Recovery of Missing Events |
2013 |
VLDB |
2 |
5.3822481e-05 |
| 8,409 |
Reverse k Nearest Neighbors Query Processing: Experiments and Analysis |
2015 |
VLDB |
3 |
5.3362771e-05 |
| 8,429 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
2 |
5.3324907e-05 |
| 8,443 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
1 |
5.3324907e-05 |
| 8,503 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5 |
5.3276429e-05 |
| 8,797 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
2 |
5.2742315e-05 |
| 8,903 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
1 |
5.2534908e-05 |
| 8,999 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
8 |
5.2396658e-05 |
| 9,318 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
3 |
5.1944733e-05 |
| 9,474 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
2 |
5.1703774e-05 |
| 9,485 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
2 |
5.168414e-05 |
| 9,492 |
Infinite Stream Estimation under Personalized w-Event Privacy |
2025 |
VLDB |
1 |
5.168414e-05 |
| 9,740 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
2 |
5.1325223e-05 |
| 9,810 |
ContextCache: Context-Aware Semantic Cache for Multi-Turn Queries in Large Language Models |
2025 |
VLDB |
1 |
5.1233734e-05 |
| 9,812 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
2 |
5.1233734e-05 |
| 9,850 |
High-Ratio Compression for Machine-Generated Data |
2023 |
SIGMOD |
3 |
5.1198764e-05 |
| 9,871 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
3 |
5.115241e-05 |
| 9,997 |
Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets |
2003 |
VLDB |
1 |
5.0971652e-05 |
| 10,067 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
3 |
5.0851868e-05 |
| 10,335 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
3 |
5.0309635e-05 |
| 10,490 |
Maintaining Biconnected Components in Streaming Graphs |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,496 |
Nucleus Decomposition Revisited: An Efficient Counting-Based Approach |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,587 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,614 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
1 |
4.9769913e-05 |
| 10,645 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,653 |
FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,715 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 10,816 |
Efficient Hyper-truss Decomposition over Hypergraphs |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,075 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,121 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9769913e-05 |
| 11,224 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
0 |
4.9769913e-05 |
| 11,294 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
2 |
4.9769913e-05 |
| 11,342 |
LogLite: Lightweight Plug-and-Play Streaming Log Compression |
2025 |
VLDB |
0 |
4.9769913e-05 |
| 11,452 |
Efficient Computation of Hyper-triangles on Hypergraphs |
2025 |
VLDB |
2 |
4.9769913e-05 |
| 11,529 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
1 |
4.9769913e-05 |
| 11,546 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9769913e-05 |
| 11,560 |
Influence Maximization via Vertex Countering |
2024 |
VLDB |
3 |
4.9769913e-05 |
| 11,567 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
0 |
4.9769913e-05 |
| 11,571 |
Utility-aware Payment Channel Network Rebalance |
2024 |
VLDB |
0 |
4.9769913e-05 |
| 11,601 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
3 |
4.9769913e-05 |
| 11,605 |
Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks |
2024 |
VLDB |
1 |
4.9769913e-05 |
| 11,606 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
0 |
4.9769913e-05 |
| 11,774 |
Efficient Non-Learning Similar Subtrajectory Search |
2023 |
VLDB |
0 |
4.9769913e-05 |
| 11,980 |
When the Recursive Diversity Anonymity Meets the Ring Signature |
2021 |
SIGMOD |
4 |
4.9769913e-05 |
| 12,101 |
IDAR: Fast Supergraph Search Using DAG Integration |
2020 |
VLDB |
1 |
4.9769913e-05 |
| 12,536 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
3 |
4.9769913e-05 |
| 12,867 |
Query Answering Techniques on Uncertain and Probabilistic Data |
2008 |
SIGMOD |
0 |
4.9769913e-05 |
| 13,761 |
IndoorViz: A Demonstration System for Indoor Spatial Data Management |
2021 |
SIGMOD |
0 |
- |
| 13,771 |
A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing |
2021 |
VLDB |
0 |
- |
| 13,947 |
CTrace: Semantic Comparison of Multi-Granularity Process Traces |
2013 |
SIGMOD |
0 |
- |
| 14,024 |
MapDupReducer: Detecting Near Duplicates over Massive Datasets |
2010 |
SIGMOD |
2 |
- |