Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Computing | en_US |
| dc.creator | Fok, Yan-yan Celia | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/4659 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Structural text compression on HTML | en_US |
| dcterms.abstract | The Internet and the world wide web enable users to access a vast amount of information anytime and anywhere using their finger tips. The current web system is mainly based on the HyperText Transfer Protocol (HTTP) for transferring hypertext documents (web pages) and the HyperText Markup Language (HTML) for creating web pages. As the Internet only provides best-effort services, it is of great interest to find ways to shorten the downloading time of web pages. One possible way is by means of data compression. By compressing web pages, not only the downloading time but also the disk storage at the server side can be reduced. Currently there are some tools to compress HTML documents. Most of them remove redundant elements in an HTML document and then compress the document using a standard data compression method. The new version of HTTP called HTTP/1.1 provides support for transferring compressed HTML documents. In this thesis, we propose a compression method to further reduce the file size of a compressed web page. The basic idea is to turn each HTML tag into a shorter code according to a predefined dictionary before compression. In some cases, it is possible to achieve even better performance by compressing the text and the codes separately, which is referred to as the partition approach. A program has been written in C to implement the proposed compression method. By compressing a number of web pages with the program, it is found that the proposed compression method can outperform the direct compression method by 5-10%. We also discuss how to implement the protocol in practice. | en_US |
| dcterms.extent | vi, 77 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2001 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | HTML (Document markup language) | en_US |
| dcterms.LCSH | Data compression (Computer science) | en_US |
| dcterms.LCSH | World Wide Web | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b1599594x.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.47 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/4659