Hannah, D., Macdonald, C. and Ounis, I. (2008) Analysis of link graph compression techniques. Lecture Notes in Computer Science, 4956, pp. 596-601. (doi: 10.1007/978-3-540-78646-7_62)
Full text not currently available from Enlighten.
Publisher's URL: http://dx.doi.org/10.1007/978-3-540-78646-7_62
Abstract
Links between documents have been shown to be useful in various Information Retrieval (IR) tasks - for example, Google has been telling us for many years now that the PageRank authority measure is at the heart of its relevance calculations. To use such link analysis techniques in a search engine, special tools are required to store the link matrix of the collection of documents, due to the high number of links typically involved. This work is concerned with the application of compression to the link graph. We compare several techniques of compressing link graphs, and conclude on speed and space metrics, using various standard IR test collections.
| Item Type: | Articles |
|---|---|
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Macdonald, Professor Craig and Hannah, Mr David and Ounis, Professor Iadh |
| Authors: | Hannah, D., Macdonald, C., and Ounis, I. |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| College/School: | College of Science and Engineering > School of Computing Science |
| Journal Name: | Lecture Notes in Computer Science |
| Publisher: | Springer |
| ISSN: | 0302-9743 |
University Staff: Request a correction | Enlighten Editors: Update this record
Deposit and Record Details
Deposit and Record Details