Space-efficient implementation of a compressed trie

• Main Author: Jeongsoo Shin
• Other Authors: Srinivasa Rao Satti, 신정수, 공과대학 컴퓨터공학부
• Format: Thesis
• Language: English
• Published: 서울대학교 대학원 2016
• Subjects: Trie; Array representation; Succinct representation; Compression algorithm; 621; Huffman; The Pointers
• Online Access: http://hdl.handle.net/10371/122659

학위논문 (석사)-- 서울대학교 대학원 : 컴퓨터공학부, 2016. 2. Srinivasa Rao Satti. Trie is the typical data structure for keyword searching algorithms. The algorithms are classified into two ways. One is the array representation, the other one is the succinct representation. In array representation, one can access the c...