A compression method of double-array structures using linear functions

A trie is one of the data structures for keyword search algorithms and is utilized in natural language processing, reserved words search for compilers and so on. The double-array and LOUDS are efficient representation methods for the trie. The double-array provides fast traversal at time complexity...

Full description

Saved in:

Bibliographic Details
Published in:	Knowledge and information systems Vol. 48; no. 1; pp. 55 - 80
Main Authors:	Kanda, Shunsuke, Fuketa, Masao, Morita, Kazuhiro, Aoe, Jun-ichi
Format:	Journal Article
Language:	English
Published:	London Springer London 01.07.2016 Springer Nature B.V
Subjects:	Algorithms Analysis Compilers Compressing Computer Science Data Mining and Knowledge Discovery Data structures Database Management Information retrieval Information Storage and Retrieval Information systems Information Systems and Communication Service Information Systems Applications (incl.Internet) IT in Business Keywords Morphology Natural language processing Regular Paper Representations Retrieval Searches Searching Software Studies Information retrieval Double-array Compression method Trie
ISSN:	0219-1377, 0219-3116
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!