| 7,290 |
Effective Indexing for Dynamic Structural Graph Clustering
|
2022 |
VLDB |
5.5643066e-05 |
| 7,303 |
Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability
|
2018 |
VLDB |
5.5598057e-05 |
| 7,311 |
Query Translation from XPath to SQL in the Presence of Recursive DTDs
|
2005 |
VLDB |
5.5562115e-05 |
| 7,323 |
Nearest Keyword Search in XML Documents
|
2011 |
SIGMOD |
5.5524474e-05 |
| 7,349 |
TimeUnion: An Efficient Architecture with Unified Data Model for Timeseries Management Systems on Hybrid Cloud Storage
|
2022 |
SIGMOD |
5.545453e-05 |
| 7,495 |
Fast Multi-Column Sorting in Main-Memory Column-Stores
|
2016 |
SIGMOD |
5.5091753e-05 |
| 7,529 |
Fast Local Subgraph Counting
|
2024 |
VLDB |
5.5009945e-05 |
| 7,541 |
Scaling and Time Warping in Time Series Querying
|
2005 |
VLDB |
5.4988401e-05 |
| 7,602 |
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks
|
2023 |
SIGMOD |
5.4868396e-05 |
| 7,622 |
Distributed Online Tracking
|
2015 |
SIGMOD |
5.4823129e-05 |
| 7,724 |
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs
|
2024 |
VLDB |
5.4672516e-05 |
| 7,752 |
Optimal Enumeration: Efficient Top-k Tree Matching
|
2015 |
VLDB |
5.4595236e-05 |
| 7,775 |
Efficient k-Clique Count Estimation with Accuracy Guarantee
|
2024 |
VLDB |
5.4548071e-05 |
| 7,807 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
|
2024 |
SIGMOD |
5.4495451e-05 |
| 7,840 |
DAG Reduction: Fast Answering Reachability Queries
|
2017 |
SIGMOD |
5.442834e-05 |
| 7,894 |
Identifying Similar-Bicliques in Bipartite Graphs
|
2022 |
VLDB |
5.4320165e-05 |
| 7,965 |
Efficient Approximate Algorithms for Empirical Entropy and Mutual Information
|
2021 |
SIGMOD |
5.4161136e-05 |
| 7,978 |
Biathlon: Harnessing Model Resilience for Accelerating ML Inference Pipelines
|
2024 |
VLDB |
5.4136835e-05 |
| 8,104 |
Logging Every Footstep: Quantile Summaries for the Entire History
|
2010 |
SIGMOD |
5.3942942e-05 |
| 8,178 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
|
2024 |
VLDB |
5.382671e-05 |
| 8,196 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries
|
2023 |
SIGMOD |
5.3794981e-05 |
| 8,211 |
LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs
|
2024 |
VLDB |
5.3772821e-05 |
| 8,249 |
On Top-k Range Reporting in 2D Space
|
2015 |
PODS |
5.3689663e-05 |
| 8,250 |
Dynamic Top-K Range Reporting in External Memory
|
2012 |
PODS |
5.3689663e-05 |
| 8,252 |
Optimal Algorithms for Multiway Search on Partial Orders
|
2022 |
PODS |
5.3685285e-05 |
| 8,259 |
Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study
|
2026 |
SIGMOD |
5.3665309e-05 |
| 8,279 |
Subset Sampling over Joins
|
2026 |
PODS |
5.3637624e-05 |
| 8,325 |
Containment Join Size Estimation: Models and Methods
|
2003 |
SIGMOD |
5.3540828e-05 |
| 8,379 |
PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs
|
2019 |
SIGMOD |
5.3432239e-05 |
| 8,393 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
|
2024 |
SIGMOD |
5.3410533e-05 |
| 8,408 |
Fast Approximate Similarity Join in Vector Databases
|
2025 |
SIGMOD |
5.336718e-05 |
| 8,415 |
Optimal Approximate Matrix Multiplication over Sliding Windows
|
2026 |
VLDB |
5.3350162e-05 |
| 8,436 |
LFTF: A Framework for Efficient Tensor Analytics at Scale
|
2017 |
VLDB |
5.3350162e-05 |
| 8,485 |
Optimizing Declarative Graph Queries at Large Scale
|
2019 |
SIGMOD |
5.3326349e-05 |
| 8,645 |
Efficiently Counting Triangles in Large Temporal Graphs
|
2025 |
SIGMOD |
5.2954976e-05 |
| 8,662 |
Top-K Nearest Keyword Search on Large Graphs
|
2013 |
VLDB |
5.2928638e-05 |
| 8,715 |
Privacy Preserving Serial Data Publishing By Role Composition
|
2008 |
VLDB |
5.2905577e-05 |
| 8,880 |
Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation
|
2024 |
VLDB |
5.2567693e-05 |
| 8,913 |
I/O-Efficient Planar Range Skyline and Attrition Priority Queues
|
2013 |
PODS |
5.2559789e-05 |
| 8,974 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
|
2023 |
SIGMOD |
5.2454233e-05 |
| 8,977 |
On More Efficiently and Versatilely Querying Historical k-Cores
|
2025 |
VLDB |
5.2449137e-05 |
| 9,013 |
Learning-based Property Estimation with Polynomials
|
2024 |
SIGMOD |
5.2375369e-05 |
| 9,032 |
TGraph: A Tensor-centric Graph Processing Framework
|
2025 |
SIGMOD |
5.2338437e-05 |
| 9,035 |
ChainKV: A Semantics-Aware Key-Value Store for Ethereum System
|
2023 |
SIGMOD |
5.233484e-05 |
| 9,076 |
Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee
|
2024 |
SIGMOD |
5.2283159e-05 |
| 9,081 |
MirrorKV: An Efficient Key-Value Store on Hybrid Cloud Storage with Balanced Performance of Compaction and Querying
|
2023 |
SIGMOD |
5.2283159e-05 |
| 9,140 |
Materialized View Selection & View-Based Query Planning for Regular Path Queries
|
2024 |
SIGMOD |
5.2214001e-05 |
| 9,164 |
Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation
|
2008 |
SIGMOD |
5.2151493e-05 |
| 9,183 |
Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach
|
2015 |
VLDB |
5.2116262e-05 |
| 9,191 |
Interactive Graph Search for Multiple Targets on DAGs
|
2025 |
VLDB |
5.2110714e-05 |