New Algorithms on Wavelet Trees and Applications to Information Retrieval

Details New Algorithms on Wavelet Trees and Applications to Information Retrieval New Algorithms on Wavelet Trees and Applications to Information Retrieval

2010-11-19

arxiv.org/abs/1011.4532v1

Computer Science

Data Structures and Algorithms

Scientific paper

Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, however, that this still falls short of exploiting all of the virtues of this versatile data structure. In particular we show how to use wavelet trees to solve fundamental algorithmic problems such as {\em range quantile} queries, {\em range next value} queries, and {\em range intersection} queries. We explore several applications of these queries in Information Retrieval, in particular {\em document retrieval} in hierarchical and temporal documents, and in the representation of {\em inverted lists}.

Affiliated with

Also associated with

No associations

Rating

New Algorithms on Wavelet Trees and Applications to Information Retrieval 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 New Algorithms on Wavelet Trees and Applications to Information Retrieval, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Algorithms on Wavelet Trees and Applications to Information Retrieval will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21516