Linear-Space Data Structures for Range Minority Query in Arrays

@article{Chan2014LinearSpaceDS,
  title={Linear-Space Data Structures for Range Minority Query in Arrays},
  author={Timothy M. Chan and Stephane Durocher and Matthew Skala and Bryan T. Wilkinson},
  journal={Algorithmica},
  year={2014},
  volume={72},
  pages={901-913}
}
We consider range queries that search for low-frequency elements (least frequent elements and $$\alpha $$α-minorities) in arrays. An $$\alpha $$α-minority of a query range has multiplicity no greater than an $$\alpha $$α fraction of the elements in the range. Our data structure for the least frequent element range query problem requires $$O(n)$$O(n) space, $$O(n^{3/2})$$O(n3/2) preprocessing time, and $$O(\sqrt{n})$$O(n) query time. A reduction from boolean matrix multiplication to this problem… CONTINUE READING
2
Twitter Mentions

Figures and Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.