| 439 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
72 |
0.00018247958 |
| 562 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
48 |
0.00016344855 |
| 658 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
75 |
0.00015032442 |
| 771 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
29 |
0.00014081924 |
| 934 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints |
2008 |
VLDB |
37 |
0.00012973416 |
| 942 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
58 |
0.00012936571 |
| 947 |
SPARK: Top-k Keyword Query in Relational Databases |
2007 |
SIGMOD |
32 |
0.00012910239 |
| 1,126 |
Probabilistic Skylines on Uncertain Data |
2007 |
VLDB |
28 |
0.00011888563 |
| 1,227 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
32 |
0.00011426039 |
| 1,401 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
18 |
0.0001075604 |
| 1,403 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
26 |
0.00010753743 |
| 1,440 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
25 |
0.00010630613 |
| 1,565 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
38 |
0.00010185615 |
| 1,581 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
35 |
0.00010151896 |
| 1,590 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
41 |
0.00010110798 |
| 1,632 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
17 |
0.00010005875 |
| 1,907 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
42 |
9.379165e-05 |
| 1,995 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
40 |
9.2189157e-05 |
| 2,023 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
33 |
9.1568397e-05 |
| 2,150 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
19 |
8.9509559e-05 |
| 2,201 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
23 |
8.8626226e-05 |
| 2,470 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
14 |
8.4015437e-05 |
| 2,705 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
15 |
8.0936619e-05 |
| 2,873 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
13 |
7.9005874e-05 |
| 2,933 |
Leveraging Set Relations in Exact Set Similarity Join |
2017 |
VLDB |
14 |
7.827041e-05 |
| 3,071 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
9 |
7.6670408e-05 |
| 3,145 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
24 |
7.5828479e-05 |
| 3,170 |
On Querying Historical K-Cores |
2021 |
VLDB |
23 |
7.5572564e-05 |
| 3,239 |
Distributed Algorithms on Exact Personalized PageRank |
2017 |
SIGMOD |
9 |
7.483901e-05 |
| 3,270 |
Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme |
2011 |
SIGMOD |
18 |
7.4613275e-05 |
| 3,323 |
Keyword Search on Structured and Semi-Structured Data |
2009 |
SIGMOD |
9 |
7.4116032e-05 |
| 3,337 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
9 |
7.3950425e-05 |
| 3,366 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
9 |
7.3548555e-05 |
| 3,396 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
10 |
7.3277458e-05 |
| 3,522 |
Efficient Approximate Entity Extraction with Edit Distance Constraints |
2009 |
SIGMOD |
14 |
7.2167201e-05 |
| 3,582 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
8 |
7.1715746e-05 |
| 3,778 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
26 |
7.0037629e-05 |
| 3,863 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
14 |
6.9488207e-05 |
| 3,881 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
11 |
6.9309694e-05 |
| 3,885 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
28 |
6.9282318e-05 |
| 4,057 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
12 |
6.8140795e-05 |
| 4,099 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
23 |
6.7940875e-05 |
| 4,133 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
26 |
6.7738028e-05 |
| 4,180 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
7 |
6.7474268e-05 |
| 4,214 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
16 |
6.7186746e-05 |
| 4,429 |
Efficiently Answering Top-k Typicality Queries on Large Databases |
2007 |
VLDB |
6 |
6.5873705e-05 |
| 4,567 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
22 |
6.5173666e-05 |
| 4,597 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
11 |
6.4979622e-05 |
| 4,658 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
14 |
6.468776e-05 |
| 4,767 |
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window |
2016 |
VLDB |
5 |
6.4142464e-05 |
| 4,861 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
11 |
6.3646812e-05 |
| 5,026 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
13 |
6.2965202e-05 |
| 5,790 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6 |
5.9762012e-05 |
| 6,002 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
12 |
5.9028394e-05 |
| 6,073 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8780393e-05 |
| 6,087 |
Efficient Processing of XML Path Queries Using the Disk-based F&B Index |
2005 |
VLDB |
4 |
5.8741996e-05 |
| 6,192 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
13 |
5.8377174e-05 |
| 6,209 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
8 |
5.8323161e-05 |
| 6,226 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
11 |
5.8266364e-05 |
| 6,465 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5 |
5.7596353e-05 |
| 6,511 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5 |
5.7440732e-05 |
| 6,795 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
7 |
5.6638135e-05 |
| 7,087 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5 |
5.5882877e-05 |
| 7,455 |
Demand-Aware Route Planning for Shared Mobility Services |
2020 |
VLDB |
2 |
5.5089489e-05 |
| 7,581 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5 |
5.4753678e-05 |
| 7,719 |
VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search |
2025 |
VLDB |
5 |
5.4543461e-05 |
| 7,769 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4391973e-05 |
| 7,960 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
3 |
5.4014706e-05 |
| 8,190 |
Efficient Recovery of Missing Events |
2013 |
VLDB |
2 |
5.3649295e-05 |
| 8,382 |
Reverse k Nearest Neighbors Query Processing: Experiments and Analysis |
2015 |
VLDB |
3 |
5.3266895e-05 |
| 8,395 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
9 |
5.3240312e-05 |
| 8,445 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
2 |
5.3148581e-05 |
| 8,459 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
1 |
5.3148581e-05 |
| 8,519 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
6 |
5.3100264e-05 |
| 8,815 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
2 |
5.2567916e-05 |
| 8,923 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
1 |
5.2361195e-05 |
| 9,188 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
4 |
5.1975376e-05 |
| 9,343 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
3 |
5.1772971e-05 |
| 9,451 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
2 |
5.1613384e-05 |
| 9,514 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
2 |
5.151324e-05 |
| 9,521 |
Infinite Stream Estimation under Personalized w-Event Privacy |
2025 |
VLDB |
1 |
5.151324e-05 |
| 9,679 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
1 |
5.1258854e-05 |
| 9,772 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
2 |
5.115551e-05 |
| 9,844 |
ContextCache: Context-Aware Semantic Cache for Multi-Turn Queries in Large Language Models |
2025 |
VLDB |
1 |
5.1064323e-05 |
| 9,846 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
2 |
5.1064323e-05 |
| 9,874 |
High-Ratio Compression for Machine-Generated Data |
2023 |
SIGMOD |
3 |
5.1049732e-05 |
| 10,032 |
Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets |
2003 |
VLDB |
1 |
5.080531e-05 |
| 10,101 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
3 |
5.068372e-05 |
| 10,361 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
3 |
5.014328e-05 |
| 10,379 |
Algebraic Subgraph Counting |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,556 |
Maintaining Biconnected Components in Streaming Graphs |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,562 |
Nucleus Decomposition Revisited: An Efficient Counting-Based Approach |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,675 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 10,706 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,714 |
FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,776 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,877 |
Efficient Hyper-truss Decomposition over Hypergraphs |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,136 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,182 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9605343e-05 |
| 11,280 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
0 |
4.9605343e-05 |
| 11,349 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
3 |
4.9605343e-05 |
| 11,395 |
LogLite: Lightweight Plug-and-Play Streaming Log Compression |
2025 |
VLDB |
0 |
4.9605343e-05 |
| 11,504 |
Efficient Computation of Hyper-triangles on Hypergraphs |
2025 |
VLDB |
2 |
4.9605343e-05 |
| 11,578 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
1 |
4.9605343e-05 |
| 11,595 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9605343e-05 |
| 11,609 |
Influence Maximization via Vertex Countering |
2024 |
VLDB |
3 |
4.9605343e-05 |
| 11,616 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
0 |
4.9605343e-05 |
| 11,620 |
Utility-aware Payment Channel Network Rebalance |
2024 |
VLDB |
0 |
4.9605343e-05 |
| 11,648 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
4 |
4.9605343e-05 |
| 11,652 |
Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks |
2024 |
VLDB |
1 |
4.9605343e-05 |
| 11,653 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
0 |
4.9605343e-05 |
| 11,818 |
Efficient Non-Learning Similar Subtrajectory Search |
2023 |
VLDB |
0 |
4.9605343e-05 |
| 12,024 |
When the Recursive Diversity Anonymity Meets the Ring Signature |
2021 |
SIGMOD |
4 |
4.9605343e-05 |
| 12,145 |
IDAR: Fast Supergraph Search Using DAG Integration |
2020 |
VLDB |
1 |
4.9605343e-05 |
| 12,579 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
3 |
4.9605343e-05 |
| 12,910 |
Query Answering Techniques on Uncertain and Probabilistic Data |
2008 |
SIGMOD |
0 |
4.9605343e-05 |
| 13,801 |
IndoorViz: A Demonstration System for Indoor Spatial Data Management |
2021 |
SIGMOD |
0 |
- |
| 13,811 |
A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing |
2021 |
VLDB |
0 |
- |
| 13,987 |
CTrace: Semantic Comparison of Multi-Granularity Process Traces |
2013 |
SIGMOD |
0 |
- |
| 14,064 |
MapDupReducer: Detecting Near Duplicates over Massive Datasets |
2010 |
SIGMOD |
2 |
- |