TL;DR
This paper introduces a space-efficient data structure for rank/select queries on large alphabet strings with runs, achieving near-optimal space and query times, and demonstrates its effectiveness through implementation and comparison.
Contribution
The paper presents a novel succinct data structure for compressed rank/select operations on large alphabets with runs, improving space efficiency and query performance.
Findings
Uses r log(nσ/r) + o(r log(nσ/r)) bits of space.
Supports select and access in polylogarithmic time.
Achieves 31-46% space savings over previous methods.
Abstract
Given a string of length that is composed of runs of letters from the alphabet such that , we describe a data structure that, provided , stores the string in bits and supports select and access queries in time and rank queries in time. We show that bits are necessary for any such data structure and, thus, our solution is succinct. We also describe a data structure that uses bits, where is an arbitrary constant, with the same query times but without the restriction . By simple reductions to the colored predecessor problem, we show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
