Double array structures based on byte segmentation for n-gram
by Masao Fuketa; Kazuhiro Morita; Jun-ichi Aoe
International Journal of Computer Applications in Technology (IJCAT), Vol. 52, No. 2/3, 2015

Abstract: Retrieving keywords is used in many applications, and the most demands for retrieving keywords are speed and compactness. The double array is one of the retrieval methods, and combines fast retrieval speed with compactness. In previous researches for the double array, one-by-one-byte character in the key traversed in the trie. Therefore, this paper proposes retrieval algorithms and data structures for the double array method traversed every n byte. Moreover, the proposed method is applied to the compact double array which is the compression method of the double array. From experimental observations, the size of the proposed method becomes 41% compared with that of the original double array and 63% compared with that of the compact double array. The retrieval speed of the proposed method becomes 1.2 times faster than the original double array.

Online publication date: Sat, 26-Sep-2015

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