Efficient Data Structures for Range Selections Problem

DOI

10.2991/iccia.2012.32How to use a DOI?

Keywords

range selection, RAM model, data structure

Abstract

Building an efficient data structure for range selection problems is considered. While there are several theoretical solutions to the problem, only a few have been tried out, and there is little idea on how the others would perform. The computation model used in this paper is the RAM model with word-size . Our data structure is a practical linear space data structure that supports range selection queries in time with preprocessing time.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiaodong Wang
AU  - Jun Tian
PY  - 2014/05
DA  - 2014/05
TI  - Efficient Data Structures for Range Selections Problem
BT  - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012)
PB  - Atlantis Press
SP  - 133
EP  - 136
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccia.2012.32
DO  - 10.2991/iccia.2012.32
ID  - Wang2014/05
ER  -