Abstract
Abstract
A data structure is called succinct if its asymptotical space requirement matches the original data size. The development of succinct data structures is an important factor to deal with the explosively increasing big data. Moreover, wider variations of big data have been produced in various fields recently and there is a substantial need for the development of more application-specific succinct data structures. In this study, we review the recently proposed application-oriented succinct data structures motivated by big data applications in three different fields: privacy-preserving computation in cryptography, genome assembly in bioinformatics, and work space reduction for compressed communications.
Funder
Japan Society for the Promotion of Science
Publisher
Springer Science and Business Media LLC
Reference78 articles.
1. Aho, A. V., & Corasick, M. J. (1975). Efficient string matching: An aid to bibliographic search. Communications of the ACM, 18(6), 333–340.
2. Asharov, G., Komargodski, I., Lin, W. K., Nayak, K., & Shi, E. (2018). Optorama: Optimal
oblivious ram. In Cryptology ePrint Archive, Report 2018/892.
https://eprint.iacr.org/2018/892
.
3. Baker, B.S. (1995). On finding duplication and near-duplication in large software systems. In Reverse engineering, proceedings of 2nd working conference on (pp. 86–95). IEEE.
4. Belazzougui, D., Gagie, T., Mäkinen, V., & Previtali, M. (2016). Fully dynamic de Bruijn graphs. In International symposium on string processing and information retrieval (pp. 145–152). Springer.
5. Belazzougui, D., Gagie, T., Mäkinen, V., Previtali, M., & Puglisi, S.J. (2016). Bidirectional variable-order de Bruijn graphs. In Latin American Symposium on Theoretical Informatics (pp. 164–178). Springer.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献