Title: A construction method by divided double array structures

Authors: Masao Fuketa; Shunsuke Kanda

Addresses: Department of Information Science and Intelligent Systems, Tokushima University, Minamijosanjima 2-1, Tokushima 770-8506, Japan ' Department of Information Science and Intelligent Systems, Tokushima University, Minamijosanjima 2-1, Tokushima 770-8506, Japan

Abstract: When keywords are retrieved, speed and compactness are important. A trie is the data structure for keyword retrieval. Also, the double array is a key retrieval method by the trie and has speed and compactness. Some construction methods for the double array are proposed, but the problem is that construction time is exponentially late with large key set. To solve the problem, two methods to divide and construct the double array depending on depth are proposed. The proposed methods are confirmed to construct the double array fast.

Keywords: trie; double array construction; keyword retrieval; compression; tree structure; keywords.

DOI: 10.1504/IJISTA.2015.074336

International Journal of Intelligent Systems Technologies and Applications, 2015 Vol.14 No.3/4, pp.273 - 283

Received: 11 May 2015
Accepted: 07 Nov 2015
Published online: 22 Jan 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article