Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text
Abstract
Compressed indexing enables powerful queries over massive and repetitive textual datasets using space proportional to the compressed input. While theoretical advances have led to highly efficient index structures, their practical construction remains a bottleneck, especially for complex components like recompression RLSLP — a grammar-based representation crucial for building powerful text indexes that support widely used suffix and LCP array queries.
Fields of Study & Subjects
Algorithms and Data Compression
Data Management and Algorithms
Advanced Database Systems and Queries
Publication details
- Journal / source
- Society for Industrial and Applied Mathematics eBooks
- Pages
- 222–232
- Publication date
- 1 January 2026
- Language
- EN