期刊
THEORETICAL COMPUTER SCIENCE
卷 426, 期 -, 页码 25-41出版社
ELSEVIER
DOI: 10.1016/j.tcs.2011.12.002
关键词
Information retrieval; Document retrieval; Data structures; 1D range queries; Wavelet trees
资金
- Fondecyt, Chile [1-110066]
- Australian Research Council
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据