A Tight Lower Bound for Comparison-Based Quantile Summaries.
Graham CormodePavel VeselýPublished in: PODS (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- worst case
- np hard
- objective function
- lower and upper bounds
- lower bounding
- upper and lower bounds
- database
- online algorithms
- linear programming relaxation
- lagrangian relaxation
- competitive ratio
- vc dimension
- probability distribution
- query processing
- neural network
- real time