Compressing and Querying Integer Dictionaries Under Linearities and Repetitions
We revisit the fundamental problem of compressing an integer dictionary that supports efficient <inline-formula> <tex-math notation="LaTeX">${\mathsf {rank}}$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">${\maths...
Main Authors: | Paolo Ferragina, Giovanni Manzini, Giorgio Vinciguerra |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9945936/ |
Similar Items
-
Interactive Compression of Digital Data
by: Bruno Carpentieri
Published: (2010-01-01) -
Subpath Queries on Compressed Graphs: A Survey
by: Nicola Prezza
Published: (2021-01-01) -
Editing Compression Dictionaries toward Refined Compression-Based Feature-Space
by: Hisashi Koga, et al.
Published: (2022-06-01) -
Zuckerli: A New Compressed Representation for Graphs
by: Luca Versari, et al.
Published: (2020-01-01) -
A survey on data compression techniques: From the perspective of data quality, coding schemes, data type and applications
by: Uthayakumar Jayasankar, et al.
Published: (2021-02-01)