Abstract
We show how to use a balanced wavelet tree as a data structure that stores a list of numbers and supports efficient 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 coloured range reporting and document listing. © 2009 Springer.
Cite
CITATION STYLE
Gagie, T., Puglisi, S. J., & Turpin, A. (2009). Range quantile queries: Another virtue of wavelet trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5721 LNCS, pp. 1–6). https://doi.org/10.1007/978-3-642-03784-9_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
