Range Quantile Queries: Another Virtue of Wavelet Trees

Details Range Quantile Queries: Another Virtue of Wavelet Trees Range Quantile Queries: Another Virtue of Wavelet Trees

2009-03-27

arxiv.org/abs/0903.4726v6

Computer Science

Data Structures and Algorithms

Added note about generalization to any constant number of dimensions.

Scientific paper

We show how to use a balanced wavelet tree as a data structure that stores a list of numbers and supports efficient {\em range quantile queries}. A range quantile query takes a rank and the endpoints of a sublist and returns the number with that rank in that sublist. For example, if the rank is half the sublist's length, then the query returns the sublist's median. We also show how these queries can be used to support space-efficient {\em coloured range reporting} and {\em document listing}.

Affiliated with

Also associated with

No associations

Rating

Range Quantile Queries: Another Virtue of Wavelet Trees 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 Range Quantile Queries: Another Virtue of Wavelet Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Range Quantile Queries: Another Virtue of Wavelet Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21212