2024-03-28T17:35:30Zhttps://eprints.lib.hokudai.ac.jp/dspace-oai/requestoai:eprints.lib.hokudai.ac.jp:2115/500542022-11-17T02:08:08Zhdl_2115_20053hdl_2115_145Training Parse Trees for Efficient VF CodingUemura, TakashiYoshida, Satoshi1000070343316Kida, TakuyaAsai, TatsuyaOkamoto, Seishiopen accessThe original publication is available at www.springerlink.com007We address the problem of improving variable-length-to-fixed-length codes (VF codes), which have favourable properties for fast compressed pattern matching but moderate compression ratios. Compression ratio of VF codes depends on the parse tree that is used as a dictionary. We propose a method that trains a parse tree by scanning an input text repeatedly, and we show experimentally that it improves the compression ratio of VF codes rapidly to the level of state-of-the-art compression methods.Springer Berlin / Heidelberg2010engbook partAMhttp://hdl.handle.net/2115/50054String Processing and Information Retrieval : 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings (Lecture Notes in Computer Science; 6393), 2010, pp.179-184, ISBN: 978-3-642-16320-3, ISSN: 0302-9743, E-ISSN: 1611-3349https://doi.org/10.1007/978-3-642-16321-0_17https://eprints.lib.hokudai.ac.jp/dspace/bitstream/2115/50054/3/SPIR6393_179-184.pdfapplication/pdf470.84 KB2010