Estimating Range Queries using Aggregate Data with Integrity Constraints: a Probabilistic Approach

Details Estimating Range Queries using Aggregate Data with Integrity Constraints: a Probabilistic Approach Estimating Range Queries using Aggregate Data with Integrity Constraints: a Probabilistic Approach

2005-01-14

arxiv.org/abs/cs/0501029v1

Computer Science

Databases

46 pages, 6 figures

Scientific paper

The problem of recovering (count and sum) range queries over multidimensional data only on the basis of aggregate information on such data is addressed. This problem can be formalized as follows. Suppose that a transformation T producing a summary from a multidimensional data set is used. Now, given a data set D, a summary S=T(D) and a range query r on D, the problem consists of studying r by modelling it as a random variable defined over the sample space of all the data sets D' such that T(D) = S. The study of such a random variable, done by the definition of its probability distribution and the computation of its mean value and variance, represents a well-founded, theoretical probabilistic approach for estimating the query only on the basis of the available information (that is the summary S) without assumptions on original data.

Affiliated with

Also associated with

No associations

Rating

Estimating Range Queries using Aggregate Data with Integrity Constraints: a Probabilistic Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Estimating Range Queries using Aggregate Data with Integrity Constraints: a Probabilistic Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimating Range Queries using Aggregate Data with Integrity Constraints: a Probabilistic Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-87748