| 658 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
75 |
0.00015032442 |
| 1,227 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
32 |
0.00011426039 |
| 1,403 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
26 |
0.00010753743 |
| 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 |
| 2,339 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
15 |
8.599495e-05 |
| 2,635 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
20 |
8.1795762e-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 |
| 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,396 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
10 |
7.3277458e-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,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,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,448 |
Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games |
2024 |
SIGMOD |
8 |
6.1108214e-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,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,268 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
5 |
5.553602e-05 |
| 7,581 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5 |
5.4753678e-05 |
| 7,649 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
2 |
5.4598986e-05 |
| 7,743 |
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs |
2024 |
VLDB |
3 |
5.4465939e-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,102 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
3 |
5.3739121e-05 |
| 8,219 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries |
2023 |
SIGMOD |
6 |
5.359172e-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,923 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
1 |
5.2361195e-05 |
| 9,103 |
Machine Learning for Graph Data Management and Query Processing |
2025 |
VLDB |
1 |
5.208561e-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,772 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
2 |
5.115551e-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,333 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
1 |
5.0225409e-05 |
| 10,377 |
AGRL: An Agentic GraphRAG Framework with Reinforcement Learning for Database Configuration Debugging |
2027 |
SIGMOD |
0 |
4.9605343e-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,672 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 10,675 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 10,689 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,706 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
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,123 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
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,243 |
AJOSC: Adaptive Join Order Selection for Continuous Queries |
2025 |
SIGMOD |
0 |
4.9605343e-05 |
| 11,280 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
0 |
4.9605343e-05 |
| 11,321 |
ACE: A Cardinality Estimator for Set-Valued Queries |
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,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 |
| 11,969 |
Online Ridesharing with Meeting Points |
2022 |
VLDB |
1 |
4.9605343e-05 |