On Approximate Range Mode and Range Selection

07/19/2019
by   Hicham El-Zein, et al.
0

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((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 Bounds and Approximations for Range Mode, ICALP'10) by reducing the space cost by a factor of n while achieving the same query time. We also design an O(n)-word dynamic data structure that answers queries in O( n / n) time and supports insertions and deletions in O( n) time, for any constant ϵ∈ (0,1). This is the first result on dynamic approximate range mode; it can also be used to obtain the first static data structure for approximate 3-sided range mode queries in two dimensions. We also consider approximate range selection. For any α∈ (0,1/2), an α-approximate range selection query asks for the position of an element whose rank in the query range is in [k - α s, k + α s], where k is a rank given by the query and s is the size of the query range. When α is a constant, we design an O(n)-bit encoding data structure that can answer queries in constant time and prove this space cost is asymptotically optimal. The previous best result by Krizanc et al. (Range Mode and Range Median Queries on Lists and Trees, Nordic Journal of Computing, 2005) uses O(n n) bits, or O(n) words, to achieve constant approximation for range median only. Thus we not only improve the space cost, but also provide support for any arbitrary k given at query time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2020

Lower Bound for Succinct Range Minimum Query

Given an integer array A[1..n], the Range Minimum Query problem (RMQ) as...
research
07/10/2018

Improved Time and Space Bounds for Dynamic Range Mode

Given an array A of n elements, we wish to support queries for the most ...
research
11/05/2018

Optimal Succinct Rank Data Structure via Approximate Nonnegative Tensor Decomposition

Given an n-bit array A, the succinct rank data structure problem asks to...
research
04/19/2020

Faster Dynamic Range Mode

In the dynamic range mode problem, we are given a sequence a of length b...
research
02/18/2021

Range Minimum Queries in Minimal Space

We consider the problem of computing a sequence of range minimum queries...
research
03/06/2019

Encoding 3SUM

We consider the following problem: given three sets of real numbers, out...
research
07/25/2019

Enumerating Range Modes

We consider the range mode problem where given a sequence and a query ra...

Please sign up or login with your details

Forgot password? Click here to reset