NobleBlocks
Public

Computing Data Distribution from Query Selectivities

Published in arXiv (Cornell University) • Jan 1, 2024
Authors:
Pankaj K. Agarwal
,
Rahul Raychaudhury
,
Stavros Sintos

Abstract

We are given a set $\mathcal{Z}=\{(R_1,s_1),\ldots, (R_n,s_n)\}$, where each $R_i$ is a \emph{range} in $\Re^d$, such as rectangle or ball, and $s_i \in [0,1]$ denotes its \emph{selectivity}. The goal is to compute a small-size \emph{discrete data distribution} $\mathcal{D}=\{(q_1,w_1),\ldots, (q_m,...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!