| 3,873 |
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases |
2012 |
VLDB |
6.673504e-05 |
| 4,209 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
6.3511029e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0340995e-05 |
| 4,959 |
Efficient Subgraph Search over Large Uncertain Graphs |
2011 |
VLDB |
5.7992713e-05 |
| 4,976 |
Constrained Shortest Path Query in a Large Time-Dependent Graph |
2019 |
VLDB |
5.7854051e-05 |
| 5,021 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
5.7481039e-05 |
| 5,909 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
5.2722596e-05 |
| 6,086 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
5.2157921e-05 |
| 6,435 |
An Experimental Evaluation of Anomaly Detection in Time Series |
2024 |
VLDB |
5.0555305e-05 |
| 6,447 |
Multivariate Time Series Cleaning under Speed Constraints |
2024 |
SIGMOD |
5.0534784e-05 |
| 6,530 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
5.0197442e-05 |
| 6,811 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
4.9139947e-05 |
| 7,081 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
4.833459e-05 |
| 7,586 |
LakeCompass: An End-to-End System for Data Maintenance, Search and Analysis in Data Lakes |
2024 |
VLDB |
4.700127e-05 |
| 8,121 |
LakeBench: A Benchmark for Discovering Joinable and Unionable Tables in Data Lakes |
2024 |
VLDB |
4.5771143e-05 |
| 9,152 |
Doctopus: Budget-aware Structural Table Extraction from Unstructured Documents |
2025 |
VLDB |
4.380727e-05 |
| 9,246 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
4.3648789e-05 |
| 9,252 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
4.3648789e-05 |
| 9,330 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4.351469e-05 |
| 9,641 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
4.3067693e-05 |
| 9,767 |
TVM: A Tile-based Video Management Framework |
2024 |
VLDB |
4.2815042e-05 |
| 10,028 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,033 |
Scaling Up k-Clique Percolation Community Detection |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,037 |
The Power of Core Clique Removal for Exact Clique Enumeration |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,057 |
Budgeted Strong Community Search in Heterogeneous Graphs |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,239 |
BRIEF: Bi-level Coreset Selection for Efficient Instruction Tuning in LLMs |
2026 |
VLDB |
4.1905499e-05 |
| 10,272 |
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 10,304 |
Aquila: A High-Concurrency System for Incremental Graph Query |
2026 |
VLDB |
4.1905499e-05 |
| 10,385 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,448 |
Doctopus: A System for Budget-aware Structural Data Extraction from Unstructured Documents |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,500 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,537 |
Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,554 |
OpenFGL: A Comprehensive Benchmark for Federated Graph Learning |
2025 |
VLDB |
4.1905499e-05 |
| 10,604 |
Truss Decomposition in Hypergraphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,758 |
QUEST: Query Optimization in Unstructured Document Analysis |
2025 |
VLDB |
4.1905499e-05 |
| 10,869 |
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,960 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
4.1905499e-05 |
| 10,962 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,003 |
MisDetect: Iterative Mislabel Detection using Early Loss |
2024 |
VLDB |
4.1905499e-05 |
| 11,051 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 11,089 |
FedGTA: Topology-aware Averaging for Federated Graph Learning |
2024 |
VLDB |
4.1905499e-05 |
| 11,228 |
ACTA: Autonomy and Coordination Task Assignment in Spatial Crowdsourcing Platforms |
2023 |
VLDB |
4.1905499e-05 |
| 11,304 |
Privacy-preserving Cooperative Online Matching over Spatial Crowdsourcing Platforms |
2023 |
VLDB |
4.1905499e-05 |
| 13,148 |
DocDB: A Database for Unstructured Document Analysis |
2025 |
VLDB |
- |
| 13,166 |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning |
2024 |
VLDB |
- |
| 13,188 |
Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach |
2024 |
VLDB |
- |
| 13,779 |
XBase: Making Your Gigabyte Disk Queriable |
2002 |
SIGMOD |
- |