| 456 |
Mergeable Summaries |
2012 |
PODS |
52 |
0.00017904764 |
| 1,590 |
Efficient Searching with Linear Constraints (Extended Abstract) |
1998 |
PODS |
15 |
0.00010134811 |
| 1,646 |
Indexing Moving Points (Extended Abstract) |
2000 |
PODS |
13 |
9.9882795e-05 |
| 2,485 |
Processing a Large Number of Continuous Preference Top-k Queries |
2012 |
SIGMOD |
18 |
8.3954142e-05 |
| 3,172 |
Toward Computational Fact-Checking |
2014 |
VLDB |
17 |
7.5658423e-05 |
| 3,618 |
A Monte Carlo Algorithm for Fast Projective Clustering |
2002 |
SIGMOD |
7 |
7.1525532e-05 |
| 3,757 |
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures |
2016 |
PODS |
6 |
7.0419501e-05 |
| 4,838 |
Nearest-Neighbor Searching Under Uncertainty |
2012 |
PODS |
6 |
6.3849712e-05 |
| 4,908 |
Subtrajectory Clustering: Models and Algorithms |
2018 |
PODS |
5 |
6.3577845e-05 |
| 5,883 |
Indexing Uncertain Data |
2009 |
PODS |
5 |
5.9560433e-05 |
| 6,743 |
Efficiently Answering Durability Prediction Queries |
2021 |
SIGMOD |
4 |
5.6892637e-05 |
| 7,168 |
Nearest Neighbor Searching Under Uncertainty II |
2013 |
PODS |
4 |
5.592675e-05 |
| 7,334 |
Selectivity Functions of Range Queries are Learnable* |
2022 |
SIGMOD |
8 |
5.5473714e-05 |
| 7,518 |
Computing A Well-Representative Summary of Conjunctive Query Results |
2024 |
PODS |
6 |
5.5023404e-05 |
| 7,616 |
Computing Complex Temporal Join Queries Efficiently |
2022 |
SIGMOD |
6 |
5.4822011e-05 |
| 7,784 |
Efficient Indexes for Diverse Top-k Range Queries |
2020 |
PODS |
5 |
5.4520677e-05 |
| 8,393 |
PARQO: Penalty-Aware Robust Plan Selection in Query Optimization |
2024 |
VLDB |
8 |
5.3387995e-05 |
| 8,841 |
On Reporting Durable Patterns in Temporal Proximity Graphs |
2024 |
PODS |
1 |
5.2655908e-05 |
| 9,196 |
Finding Diverse, High-Value Representatives on a Surface of Answers |
2017 |
VLDB |
3 |
5.208891e-05 |
| 9,393 |
Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise |
2019 |
VLDB |
1 |
5.1843659e-05 |
| 9,735 |
PAR2QO: Parametric Penalty-Aware Robust Query Optimization |
2025 |
VLDB |
2 |
5.1325223e-05 |
| 10,380 |
Coresets for Robust Query Optimization |
2026 |
PODS |
0 |
4.9769913e-05 |
| 10,812 |
BaCon: Efficient Batch Processing of Counting Queries |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,405 |
Hint-QPT: Hints for Robust Query Performance Tuning |
2025 |
VLDB |
2 |
4.9769913e-05 |
| 12,258 |
Durable Top-k Queries on Temporal Data |
2018 |
VLDB |
2 |
4.9769913e-05 |
| 12,328 |
Range-Max Queries on Uncertain Data |
2016 |
PODS |
0 |
4.9769913e-05 |
| 12,468 |
iCheck: Computationally Combating "Lies, D-ned Lies, and Statistics" |
2014 |
SIGMOD |
1 |
4.9769913e-05 |
| 13,008 |
Scalable Continuous Query Processing by Tracking Hotspots |
2006 |
VLDB |
1 |
4.9769913e-05 |
| 13,060 |
k-Means Projective Clustering |
2004 |
PODS |
0 |
4.9769913e-05 |
| 14,078 |
ProSem: Scalable Wide-Area Publish/Subscribe |
2008 |
SIGMOD |
1 |
- |