Optimized succinct data structures for massive data

@article{Gog2014OptimizedSD,
  title={Optimized succinct data structures for massive data},
  author={Simon Gog and Matthias Petri},
  journal={Softw., Pract. Exper.},
  year={2014},
  volume={44},
  pages={1287-1314}
}
Succinct data structures provide the same functionality as their corresponding traditional data structure in compact space. We improve on functions rank and select , which are the basic building blocks of FM-indexes and other succinct data structures. First, we present a cache-optimal, uncompressed bitvector representation which outperforms all existing approaches. Next, we improve — in both space and time — on a recent result by Navarro and Providel on compressed bitvectors. Last we show… CONTINUE READING
Highly Cited
This paper has 45 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

Rank and select: Another lesson learned

View 5 Excerpts
Highly Influenced

Sampled suffix array with minimizers

Softw., Pract. Exper. • 2017
View 5 Excerpts
Method Support
Highly Influenced

Hybrid Compression of Bitvectors for the FM-Index

2014 Data Compression Conference • 2014
View 6 Excerpts
Method Support
Highly Influenced

FM-index for Dummies

View 4 Excerpts
Highly Influenced

Practical Compact Indexes for Top-k Document Retrieval

ACM Journal of Experimental Algorithmics • 2017
View 3 Excerpts
Highly Influenced

A Simplified Description of Child Tables for Sequence Similarity Search

IEEE/ACM Transactions on Computational Biology and Bioinformatics • 2018
View 1 Excerpt

Accelerating Sequence Alignments Based on FM-Index Using the Intel KNL Processor.

IEEE/ACM transactions on computational biology and bioinformatics • 2018
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Compressed text indexes: From theory to practice

ACM Journal of Experimental Algorithmics • 2008
View 18 Excerpts
Highly Influenced

Broadword Implementation of Rank/Select Queries

WEA • 2008
View 26 Excerpts
Highly Influenced

Compact Pat Trees

David R. Clark
PhD thesis, University of Waterloo, • 1996
View 7 Excerpts
Highly Influenced

Succinct static data structures

Guy Joseph Jacobson
PhD thesis, • 1988
View 8 Excerpts
Highly Influenced

Providel. Fast, small, simple rank/select on bitmaps

Gonzalo Navarro, Eliana
In Proc. of the 11th International Symposium on Experimental Algorithms (SEA), • 2012
View 10 Excerpts
Highly Influenced