Title: Effectiveness of an implementation method for retrieving similar strings by trie structures

Authors: Masao Fuketa; Toshiyuki Tamai; Kazuhiro Morita; Jun-ichi Aoe

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

Abstract: Demands for retrieving similar strings have been increasing. There are many methods for retrieving similar strings, and most methods must build dedicated dictionaries. In ubiquitous environments, because the storage capacity is often limited, the dictionary size must be compact. Therefore, this paper proposes a data structure and a fast retrieval algorithm for similar strings by existing tries. Moreover, the retrieval speed for some implementation methods of a trie is compared. From experimental results, the retrieval speed of the proposed method is 2.6-3.5 times faster than that of the conventional method. The retrieval speed of list structures as an implementation method is the fastest.

Keywords: edit distance; similar strings; existing tries; double-array; string retrieval; dictionary size; data structures; fast retrieval; storage capacity; keyword matching; ubiquitous environments.

DOI: 10.1504/IJCAT.2013.056019

International Journal of Computer Applications in Technology, 2013 Vol.48 No.2, pp.130 - 135

Published online: 24 Aug 2013 *

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