A compressed trie structure using divided keys Online publication date: Tue, 03-Mar-2009
by Masaki Oono, El-Sayed Atlam, Masao Fuketa, Kazuhiro Morita, Jun-ichi Aoe
International Journal of Computer Applications in Technology (IJCAT), Vol. 34, No. 2, 2009
Abstract: A link-trie structure is an efficient data structure for collocation information using a trie structure. The link-trie stores two basic words into the trie and defines link-information by a link-function. This paper presents how to apply the link-trie into a general set of keys and compress the storage capacity. The method divides a key into several sub-keys and defines link-information between these sub-keys. From simulation results for 100,000 keys, it turns out that the presented method compresses the storage capacity by 30% smaller than the normal trie.
Online publication date: Tue, 03-Mar-2009
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:
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 email@example.com