Art
J-GLOBAL ID:201802251276630429   Reference number:18A1365327

Efficient String Dictionary Compression Using String Dictionaries

文字列辞書を用いた効率的な文字列辞書圧縮の検討と評価
Author (3):
Material:
Volume: 16-J  Page: ROMBUNNO.7 (WEB ONLY)  Publication year: Mar. 2018
JST Material Number: U0795A  ISSN: 2189-0374  Document type: Article
Article type: 原著論文  Country of issue: Japan (JPN)  Language: JAPANESE (JA)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

Semi thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

JST classification (2):
JST classification
Category name(code) classified by JST.
Other computer utilization technology  ,  System programmings in general 
Reference (18):
  • Miguel A Martínez-Prieto, Nieves Brisaboa, Rodrigo Cánovas, Francisco Claude, and Gonzalo Navarro. Practical compressed string dictionaries. Information Systems, 56:73-108, 2016.
  • Roberto Grossi and Giuseppe Ottaviano. Fast compressed tries through path decompositions. ACM Journal of Experimental Algorithmics, 19(1):Article 1.8, 2014.
  • Julian Arz and Johannes Fischer. LZ-compressed string dictionaries. In DCC, pages 322-331, 2014.
  • Shunsuke Kanda, Kazuhiro Morita, and Masao Fuketa. Compressed double-array tries for string dictionaries supporting fast lookup. Knowledge and Information Systems, 51(3):1023-1042, 2017.
  • 久田 晋. Prefix/patricia trieの入れ子による辞書圧縮. In 言語処理学会, 2011.
more...
Terms in the title (3):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page