Effectiveness of an implementation method for retrieving similar strings by trie structures
by Masao Fuketa; Toshiyuki Tamai; Kazuhiro Morita; Jun-ichi Aoe
International Journal of Computer Applications in Technology (IJCAT), Vol. 48, No. 2, 2013

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.

Online publication date: Sun, 25-Aug-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com