| 452 |
Mergeable Summaries |
2012 |
PODS |
53 |
0.00018032092 |
| 1,594 |
Efficient Searching with Linear Constraints (Extended Abstract) |
1998 |
PODS |
15 |
0.00010103178 |
| 1,654 |
Indexing Moving Points (Extended Abstract) |
2000 |
PODS |
13 |
9.9565797e-05 |
| 2,495 |
Processing a Large Number of Continuous Preference Top-k Queries |
2012 |
SIGMOD |
18 |
8.3676654e-05 |
| 3,183 |
Toward Computational Fact-Checking |
2014 |
VLDB |
17 |
7.5408249e-05 |
| 3,627 |
A Monte Carlo Algorithm for Fast Projective Clustering |
2002 |
SIGMOD |
7 |
7.1290231e-05 |
| 3,761 |
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures |
2016 |
PODS |
6 |
7.0186907e-05 |
| 4,828 |
Nearest-Neighbor Searching Under Uncertainty |
2012 |
PODS |
6 |
6.3849385e-05 |
| 4,933 |
Subtrajectory Clustering: Models and Algorithms |
2018 |
PODS |
5 |
6.3367617e-05 |
| 5,900 |
Indexing Uncertain Data |
2009 |
PODS |
5 |
5.9363649e-05 |
| 6,762 |
Efficiently Answering Durability Prediction Queries |
2021 |
SIGMOD |
4 |
5.6704515e-05 |
| 6,882 |
Computing Complex Temporal Join Queries Efficiently |
2022 |
SIGMOD |
7 |
5.6412354e-05 |
| 7,186 |
Nearest Neighbor Searching Under Uncertainty II |
2013 |
PODS |
4 |
5.574492e-05 |
| 7,355 |
Selectivity Functions of Range Queries are Learnable* |
2022 |
SIGMOD |
8 |
5.529034e-05 |
| 7,537 |
Computing A Well-Representative Summary of Conjunctive Query Results |
2024 |
PODS |
6 |
5.4841462e-05 |
| 7,798 |
Efficient Indexes for Diverse Top-k Range Queries |
2020 |
PODS |
5 |
5.4340398e-05 |
| 8,412 |
PARQO: Penalty-Aware Robust Plan Selection in Query Optimization |
2024 |
VLDB |
8 |
5.3211467e-05 |
| 8,859 |
On Reporting Durable Patterns in Temporal Proximity Graphs |
2024 |
PODS |
1 |
5.2481795e-05 |
| 9,220 |
Finding Diverse, High-Value Representatives on a Surface of Answers |
2017 |
VLDB |
3 |
5.1916672e-05 |
| 9,419 |
Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise |
2019 |
VLDB |
1 |
5.1672232e-05 |
| 9,767 |
PAR2QO: Parametric Penalty-Aware Robust Query Optimization |
2025 |
VLDB |
2 |
5.115551e-05 |
| 10,446 |
Coresets for Robust Query Optimization |
2026 |
PODS |
0 |
4.9605343e-05 |
| 10,873 |
BaCon: Efficient Batch Processing of Counting Queries |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,458 |
Hint-QPT: Hints for Robust Query Performance Tuning |
2025 |
VLDB |
2 |
4.9605343e-05 |
| 12,301 |
Durable Top-k Queries on Temporal Data |
2018 |
VLDB |
2 |
4.9605343e-05 |
| 12,371 |
Range-Max Queries on Uncertain Data |
2016 |
PODS |
0 |
4.9605343e-05 |
| 12,511 |
iCheck: Computationally Combating "Lies, D-ned Lies, and Statistics" |
2014 |
SIGMOD |
1 |
4.9605343e-05 |
| 13,050 |
Scalable Continuous Query Processing by Tracking Hotspots |
2006 |
VLDB |
1 |
4.9605343e-05 |
| 13,101 |
k-Means Projective Clustering |
2004 |
PODS |
0 |
4.9605343e-05 |
| 14,118 |
ProSem: Scalable Wide-Area Publish/Subscribe |
2008 |
SIGMOD |
1 |
- |