| 9,424 |
Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing
|
2016 |
SIGMOD |
5.2715528e-05 |
| 9,444 |
An Efficient Algorithm for Distance-based Structural Graph Clustering
|
2023 |
SIGMOD |
5.2675506e-05 |
| 9,472 |
Indexing for Keyword Search with Structured Constraints
|
2023 |
PODS |
5.2634238e-05 |
| 9,478 |
Parallel Query Processing: To Separate Communication from Computation
|
2022 |
SIGMOD |
5.2634238e-05 |
| 9,487 |
Preservation of Proximity Privacy in Publishing Numerical Sensitive Data
|
2008 |
SIGMOD |
5.2634238e-05 |
| 9,519 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
|
2024 |
SIGMOD |
5.2562724e-05 |
| 9,558 |
Efficient k-Clique Count Estimation with Accuracy Guarantee
|
2024 |
VLDB |
5.2528121e-05 |
| 9,616 |
ACGraph: An Efficient Asynchronous Out-of-Core Graph Processing Framework
|
2026 |
SIGMOD |
5.2434488e-05 |
| 9,683 |
Optimal Algorithms for Crawling a Hidden Database in the Web
|
2012 |
VLDB |
5.2352357e-05 |
| 9,690 |
Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks
|
2025 |
VLDB |
5.2351259e-05 |
| 9,692 |
Bonspiel: Low Tail Latency Transactions in Geo-Distributed Databases
|
2025 |
VLDB |
5.2351259e-05 |
| 9,693 |
Subgraph Matching: A New Decomposition Based Approach
|
2025 |
VLDB |
5.2351259e-05 |
| 9,704 |
Quegel: A General-Purpose System for Querying Big Graphs
|
2016 |
SIGMOD |
5.2351259e-05 |
| 9,719 |
Subset Sampling over Joins
|
2026 |
PODS |
5.2319816e-05 |
| 9,732 |
External Memory Stream Sampling
|
2015 |
PODS |
5.2279411e-05 |
| 9,749 |
Auto-Approximation of Graph Computing
|
2014 |
VLDB |
5.227679e-05 |
| 9,759 |
Divide & Conquer: I/O Efficient Depth-First Search
|
2015 |
SIGMOD |
5.2247222e-05 |
| 9,766 |
On Efficient Large Sparse Matrix Chain Multiplication
|
2024 |
SIGMOD |
5.2214067e-05 |
| 9,782 |
Inductive Attributed Community Search: to Learn Communities across Graphs
|
2024 |
VLDB |
5.2209769e-05 |
| 9,812 |
Interactive Graph Search for Multiple Targets on DAGs
|
2025 |
VLDB |
5.214913e-05 |
| 9,866 |
Finding Logic Bugs in Graph-processing Systems via Graph-cutting
|
2025 |
SIGMOD |
5.2043672e-05 |
| 9,871 |
Finding Logic Bugs in Spatial Database Engines via Affine Equivalent Inputs
|
2024 |
SIGMOD |
5.2043672e-05 |
| 9,883 |
On Concise Set of Relative Candidate Keys
|
2014 |
VLDB |
5.2033964e-05 |
| 9,885 |
RushMon: Real-time Isolation Anomalies Monitoring
|
2018 |
SIGMOD |
5.2014857e-05 |
| 9,889 |
SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
|
2026 |
SIGMOD |
5.1997534e-05 |
| 9,916 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
|
2025 |
VLDB |
5.1955087e-05 |
| 9,927 |
Everest: A Top-K Deep Video Analytics System
|
2022 |
SIGMOD |
5.1955087e-05 |
| 10,010 |
Large Scale Graph Mining with G-Miner
|
2019 |
SIGMOD |
5.1776969e-05 |
| 10,028 |
PRICE: A Pretrained Model for Cross-Database Cardinality Estimation
|
2025 |
VLDB |
5.1745962e-05 |
| 10,035 |
CoTra: Towards Efficient and Scalable Distributed Vector Search with RDMA
|
2026 |
SIGMOD |
5.173224e-05 |
| 10,169 |
Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries
|
2026 |
PODS |
5.093636e-05 |
| 10,179 |
Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
|
2026 |
PODS |
5.093636e-05 |
| 10,212 |
Concurrent Path-Copying Update to Tree Structures
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,226 |
Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,251 |
GPS: Revisiting the Data Layout for Disk-based High-Dimensional Vector Search
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,253 |
HAMMER: An Automatic RAG Tuning System via Hierarchical Memory-Guided Monte Carlo Tree Search
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,346 |
Beyond Vector Search: Querying With and Without Predicates
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,359 |
DiskJoin: Large-scale Vector Similarity Join with SSD
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,363 |
Efficient and Scalable Directed Densest Subgraph Discovery
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,420 |
SG-Serve: Efficient Model Serving for Subgraph-based Graph Representation Learning
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,423 |
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,425 |
Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,448 |
Efficient Influential Community Search over Dynamic Graphs
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,471 |
Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,478 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,498 |
Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,505 |
The Case For Language Model Approximated LIKE Predicate
|
2026 |
SIGMOD |
5.093636e-05 |
| 10,516 |
SACK: Shielding Dynamic Attribute-based Access Control in Persistent Key-Value Stores
|
2026 |
VLDB |
5.093636e-05 |
| 10,524 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs
|
2026 |
VLDB |
5.093636e-05 |
| 10,528 |
Effective Durable Community Search in Large Temporal Graph
|
2026 |
VLDB |
5.093636e-05 |