Indexing Compressed Text
| dc.contributor.author | He, Meng | en |
| dc.date.accessioned | 2006-08-22T14:26:12Z | |
| dc.date.available | 2006-08-22T14:26:12Z | |
| dc.date.issued | 2003 | en |
| dc.date.submitted | 2003 | en |
| dc.description.abstract | As a result of the rapid growth of the volume of electronic data, text compression and indexing techniques are receiving more and more attention. These two issues are usually treated as independent problems, but approaches of combining them have recently attracted the attention of researchers. In this thesis, we review and test some of the more effective and some of the more theoretically interesting techniques. Various compression and indexing techniques are presented, and we also present two compressed text indices. Based on these techniques, we implement an compressed full-text index, so that compressed texts can be indexed to support fast queries without decompressing the whole texts. The experiments show that our index is compact and supports fast search. | en |
| dc.format | application/pdf | en |
| dc.format.extent | 322845 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10012/1143 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.rights | Copyright: 2003, He, Meng. All rights reserved. | en |
| dc.subject | Computer Science | en |
| dc.subject | text compression | en |
| dc.subject | text indexing | en |
| dc.title | Indexing Compressed Text | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | School of Computer Science | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 1 of 1