Journal
THEORETICAL COMPUTER SCIENCE
Volume 426, Issue -, Pages 25-41Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2011.12.002
Keywords
Information retrieval; Document retrieval; Data structures; 1D range queries; Wavelet trees
Categories
Funding
- Fondecyt, Chile [1-110066]
- Australian Research Council
Ask authors/readers for more resources
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 range quantile queries, range next value queries, and range intersection queries. We explore several applications of these queries in Information Retrieval, in particular document retrieval in hierarchical and temporal documents, and in the representation of inverted lists. (C) 2011 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available