Presentation 2014/7/25
A Compression Method of Double Array Structures using Approximate Straight Lines
SHUNSUKE KANDA, KAZUHIRO MORITA, MASAO FUKETA, JUN-ICHI AOE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A trie is one of the method for key search algorithm and utilized in natural language processing and so on. It is represented by a double array and LOUDS. The double array provides fast retrieval at time complexty of O(1), but its space usage is larger than that of LOUDS. LOUDS is a succinct data structure using bit-vector. Its space usage is extremely compact, but its retrieval speed is not so fast. This paper presents a compression method of the double array using approximate straight lines. Prom simulation results for 200,000~1,000,000 keys, it turned out that the space usage of the presented method becomes about 60% compared with the double array and its retrieval speed is about twelve times faster than that of LOUDS.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # Vol.2014-DBS-159 No.11,Vol.2014-IFAT-115 No.11
Date of Issue

Conference Information
Committee DE
Conference Date 2014/7/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Compression Method of Double Array Structures using Approximate Straight Lines
Sub Title (in English)
Keyword(1)
1st Author's Name SHUNSUKE KANDA
1st Author's Affiliation University of Tokushima()
2nd Author's Name KAZUHIRO MORITA
2nd Author's Affiliation University of Tokushima
3rd Author's Name MASAO FUKETA
3rd Author's Affiliation University of Tokushima
4th Author's Name JUN-ICHI AOE
4th Author's Affiliation University of Tokushima
Date 2014/7/25
Paper # Vol.2014-DBS-159 No.11,Vol.2014-IFAT-115 No.11
Volume (vol) vol.114
Number (no) 173
Page pp.pp.-
#Pages 6
Date of Issue