Word-based compression in full-text retrieval systems

Date

1995

Editor(s)

Advisor

Eyler, M. Akif

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
2
views
15
downloads

Series

Abstract

Large space requirement of a full-text retrieval system can be reduced significantly by data compression. In this study, the problem of compressing the main text of a full-text retrieval system is addressed and performance of several coding techniques for compressing the text database is compared. Experiments show that statistical techniques, such as arithmetic coding and Huffman coding, give the best compression among the implemented; and using a semi-static word-based model, the space needed to store English text is less than one third of the original requirement.

Source Title

Publisher

Course

Other identifiers

Book Title

Degree Discipline

Industrial Engineering

Degree Level

Master's

Degree Name

MS (Master of Science)

Citation

Published Version (Please cite this version)

Language

English

Type