By Topic

Modified LZW algorithm for efficient compressed text retrieval

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)
N. Zhang ; Sch. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA ; T. Tao ; Ravi Vijaya Satya ; Amar Mukherjee

With increasing amount of text data being stored in the compressed format, efficient information retrieval in the compressed domain has become a major concern. Being able to randomly access the compressed data is highly desirable for efficient retrieval and is required in many applications. For example, in a library information retrieval system, only the records that are relevant to the query are displayed. We present modified LZW algorithms that support fast random access to the compressed text. Instead of fully decompressing the text and outputting the results selectively, we allow random access and partial decoding of the compressed text and displaying the relevant portion. The compression ratio can also be improved using the modified LZW algorithm. Preliminary results on the time and storage performance are given.

Published in:

Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on  (Volume:2 )

Date of Conference:

5-7 April 2004