Compressed persistent index for efficient rank/select queries

DOI10.1007/978-3-642-40104-6_35MaRDI QIDQ2842178zbMATH OpenOpenAlexFDO

Authors Wing-Kai Hon, Lap-Kei Lee, Kunihiko Sadakane, Konstantinos Tsakalidis

Publication date 12 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40104-6_35

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Rank/select on dynamic compressed sequences and applications
• Optimal indexes for sparse bit vectors
• Rank and select revisited and extended
• High-order entropy compressed bit vectors with rank/select
• Compressed indexes for dynamic text collections

Cited in

(1)

• Fully persistent B-trees

This page was built for publication: Compressed persistent index for efficient rank/select queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842178)