A construction method by divided double array structures
by Masao Fuketa; Shunsuke Kanda
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 14, No. 3/4, 2015

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.

Online publication date: Fri, 22-Jan-2016

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 Intelligent Systems Technologies and Applications (IJISTA):
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