Abstract:For any ∈ (0, 1), a (1 + )-approximate range mode query asks for the position of an element whose frequency in the query range is at most a factor (1 + ) smaller than the true mode. For this problem, we design an O(n ) bit data structure supporting queries in O(lg(1 )) time. This is an encoding data structure which does not require access to the input sequence; we prove the space cost is asymptotically optimal for constant . Our solution improves the previous best result of Greve et al. (Cell Probe Lower Bound… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.