Subject
Hardware and Architecture,Information Systems,Software
Reference68 articles.
1. D. Arroyuelo, F. Claude, S. Maneth, V. Mäkinen, G. Navarro, K. Nguyễn, K. Sirén, N. Välimäki, Fast in-memory XPath search over compressed text and tree indexes. in: Proceedings of 26th IEEE International Conference on Data Engineering (ICDE), 2010, pp. 417–428.
2. D. Arroyuelo, S. González, M. Oyarzún, Compressed self-indices supporting conjunctive queries on document collections, in: Proceedings of 17th International Symposium on String Processing and Information Retrieval (SPIRE), 2010, pp. 43–54.
3. Succinct representation of labeled graphs;Barbay;Algorithmica,2012
4. J. Barbay, F. Claude, T. Gagie, G. Navarro, Y. Nekrich, Efficient fully-compressed sequence representations, Algorithmica 69 (1) (2014) 232–268.
5. J. Barbay, F. Claude, G. Navarro. Compact rich-functional binary relation representations, in: Proceedings of 9th Latin American Symposium on Theoretical Informatics (LATIN), Lecture Notes in Computer Science, vol. 6034, 2010, pp. 170–183.
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bit-Parallel Wavelet Tree Construction (Abstract);Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing;2024-06-17
2. The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space;ACM Transactions on Database Systems;2024-03-23
3. Faster Wavelet Tree Queries;2024 Data Compression Conference (DCC);2024-03-19
4. Optimizing RPQs over a compact graph representation;The VLDB Journal;2023-09-07
5. Bit-Parallel (Compressed) Wavelet Tree Construction;2023 Data Compression Conference (DCC);2023-03