By Topic

An efficient compression method for Patricia tries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
M. Shishibori ; Dept. of Inf. Sci. & Intelligent Syst., Tokushima Univ., Japan ; M. Okuno ; K. Ando ; Jun-Ichi Aoe

In many applications, information retrieval is a very important research field. In several key strategies, the trie is famous as a fast access method to be able to retrieve keys in order. Especially, the Patricia trie gives the shallowest trie by eliminating all single descendant nodes, for this reason, the Patricia trie is often used as indices of information retrieval systems. If trie structures are implemented, however, the greater the number of registered keys, the larger storage is required. Jonge et al. (1987) proposed a method to change the normal binary trie into a compact bit stream. This paper shows the method for compressing the Patricia trie into the new bit stream. The theoretical and experimental results show that this method generates 40~60 percent shorter than the traditional method. This method thus enables us to provide more compact storage and faster access than the traditional method

Published in:

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on  (Volume:1 )

Date of Conference:

12-15 Oct 1997