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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Knowledge and information systems Ročník 48; číslo 1; s. 55 - 80
Hlavní autori:	Kanda, Shunsuke, Fuketa, Masao, Morita, Kazuhiro, Aoe, Jun-ichi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Springer London 01.07.2016 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!