Optimized succinct data structures for massive data

Software - Practice and Experience

Volumn 44, Issue 11, 2014, Pages 1287-1314

  Gog, Simon ^a   Petri, Matthias ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b RMIT UNIVERSITY   (Australia)

Author keywords

Algorithm engineering; Binary sequences; FM index; Hugepages; Massive data sets; Rank; Select; SSE; Succinct data structures

Indexed keywords

BINARY SEQUENCES; FREQUENCY MODULATION; METADATA;

ALGORITHM ENGINEERING; FM-INDEX; HUGEPAGES; MASSIVE DATA SETS; RANK; SELECT; SUCCINCT DATA STRUCTURE;

DATA STRUCTURES;

EID: 84907874378     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.2198     Document Type: Article

References (31)

1. Hon W-K, Shah R, Vitter JS. Compression, indexing, and retrieval for massive string data. In Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (CPM), New York, NY, USA, 2010; 260-274.
2. Culpepper JS, Petri M, Scholer F. Efficient in-memory top-k document retrieval. In Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), Portland, OR, USA, 2012; 225-234.
3. Mäkinen V, Navarro G, Sirén J, Välimäki N. Storage and retrieval of individual genomes. In Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (RECOMB), Tucson, AZ, USA, 2009; 121-137.
4. Gog S. Compressed suffix trees: Design, construction, and applications. Ph.D. Thesis, Ulm University, Ulm, Germany, 2011.
5. Ohlebusch E, Fischer J, Gog S. CST++. In Proceedings of the 17th International Symposium on String Processing and Information Retrieval (SPIRE), Los Cabos, Mexico, 2010; 322-333.
6. Ferragina P, Manzini G. Opportunistic data structures with applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), Redondo Beach, California, USA, 2000; 390-398.
7. Ferragina P, Manzini G, Mäkinen V, Navarro G. An alphabet-friendly FM-index. In Proceedings of the 11th International Conference on String Processing and Information Retrieval (SPIRE), Padova, Italy, 2004; 150-160.
8. Haque IS, Pande VS, Walters WP. Anatomy of high-performance 2D similarity calculations. Journal of Chemical Information and Modeling 2011; 51(9):2345-2351.
9. Suciu A, Cobarzan P, Marton K. The never ending problem of counting bits efficiently. In Proceedings of the 10th Roedunet International Conference (ROEDUNET), Iasi, Romania, 2011; 1-4.
10. Knuth D. The Art of Computer Programming, Volume 4a, The: Combinatorial Algorithms, Part 1. Addison-Wesley: Reading, Massachusetts, 2011.
11. Vigna S. Broadword implementation of rank/select queries. In Proceedings of 7th Won Experimental Algorithms (WEA), Provincetown, MA, USA, 2008; 154-168.
12. Munro I. Tables. In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Hyderabad, India, 1996; 37-42.
13. Clark DR. Compact Pat Trees. Ph.D. Thesis, University of Waterloo, 1996.
14. Navarro G, Providel E. Fast, small, simple rank/select on bitmaps. In Proceedings of the 11th International Symposium on Experimental Algorithms (SEA), Bordeaux, France, 2012; 295-306.
15. Ferragina P, González R, Navarro G, Venturini R. Compressed text indexes: from theory to practice. ACM Journal of Experimental Algorithmics 2008; 13:1-31.
16. González R, Grabowski S, Mäkinen V, Navarro G. Practical implementation of rank and select queries. In Proceedings of 4th Workshop on Experimental and Efficient Algorithms (WEA), Santorini Island, Greece, 2005; 27-38.
17. Grossi R, Gupta A, Vitter JS. High-order entropy-compressed text indexes. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, Maryland, USA, 2003; 841-850.
18. Navarro G. Wavelet trees for all. In Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM), Helsinki, Finland, 2012; 2-26.
19. Jacobson GJ. Succinct static data structures. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, PA, USA, 1988. AAI8918056.
20. Raman R, Raman V, Rao SS. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, USA, 2002; 233-242.
21. Claude F, Navarro G. Practical rank/select queries over arbitrary sequences. In Proceedings of the 15th International Conference on String Processing and Information Retrieval (SPIRE), Melbourne, Australia, 2008; 176-187.
22. Pagh R. Low redundancy in static dictionaries with O(1) worst case lookup time. TEchnical Report RS-98-28, BRICS, Department of Computer Science, University of Aarhus, Midtbyen, Aarhus, Denmark, 1998.
23. Okanohara D, Sadakane K. Practical entropy-compressed rank/select dictionary. In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, USA, 2007.
24. Elias P. Efficient storage and retrieval by content and address of static files. Journal of the ACM 1974; 21(2):246-260.
25. Manber U, Myers EW. Suffix arrays: a new method for on-line string searches. SIAM Journal of Computing 1993; 22(5):935-948.
26. Navarro G, Mäkinen V. Compressed full-text indexes. ACM Computing Surveys 2007; 39(1):1-31.
27. Burrows M, Wheeler DJ. A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, California, 1994.
28. Mäkinen V, Navarro G. Succinct suffix arrays based on run-length encoding. In Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM), Jeju Island, Korea, 2005; 45-56.
29. Kärkkäinen J, Puglisi SJ. Fixed block compression boosting in FM-indexes. In Proceedings of the 18th International Conference on String Processing and Information Retrieval (SPIRE), Pisa, Italy, 2011; 174-184.
30. Fog A. Instruction tables, 2012. Available from: http://www.agner.org/optimize/instruction-tables.pdf (accessed March 13, 2012).
31. Sadakane K. New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 2003; 48(2):294-313.