| 659 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
74 |
0.00015048943 |
| 1,224 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
32 |
0.00011458287 |
| 1,397 |
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach |
2008 |
SIGMOD |
26 |
0.00010787659 |
| 1,626 |
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks |
2014 |
VLDB |
17 |
0.00010039008 |
| 1,664 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
39 |
9.9394611e-05 |
| 2,328 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
15 |
8.6269174e-05 |
| 2,635 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
19 |
8.1954989e-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 |
| 3,251 |
On Querying Historical K-Cores |
2021 |
VLDB |
22 |
7.4903737e-05 |
| 3,329 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
22 |
7.4158814e-05 |
| 3,412 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
10 |
7.321657e-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,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,424 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6 |
6.6029248e-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,432 |
Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games |
2024 |
SIGMOD |
8 |
6.1310946e-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,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,250 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
5 |
5.5720266e-05 |
| 7,567 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5 |
5.4933119e-05 |
| 7,640 |
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling |
2017 |
SIGMOD |
2 |
5.4766381e-05 |
| 7,730 |
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs |
2024 |
VLDB |
3 |
5.4646635e-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,084 |
Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach |
2024 |
VLDB |
3 |
5.3917406e-05 |
| 8,204 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries |
2023 |
SIGMOD |
6 |
5.3769515e-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,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,082 |
Machine Learning for Graph Data Management and Query Processing |
2025 |
VLDB |
1 |
5.2258409e-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,740 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
2 |
5.1325223e-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 |
| 10,305 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
1 |
5.0392037e-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,611 |
Time-Critical Influence Minimization via Node Blocking |
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,628 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,645 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
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,062 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
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,184 |
AJOSC: Adaptive Join Order Selection for Continuous Queries |
2025 |
SIGMOD |
0 |
4.9769913e-05 |
| 11,224 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
0 |
4.9769913e-05 |
| 11,265 |
ACE: A Cardinality Estimator for Set-Valued Queries |
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,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,925 |
Online Ridesharing with Meeting Points |
2022 |
VLDB |
1 |
4.9769913e-05 |