Towards compressing Web graphs
Adler, M.
Mitzenmacher, M.
Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA;
This paper appears in: Data Compression Conference, 2001. Proceedings. DCC 2001.
Publication Date: 2001
On page(s): 203-212
Meeting Date: 03/27/2001 - 03/29/2001
Location: Snowbird, UT, USA
ISSN: 1068-0314
ISBN: 0-7695-1031-0
References Cited: 20
INSPEC Accession Number: 7042416
Digital Object Identifier: 10.1109/DCC.2001.917151
Current Version Published: 2002-08-07
Abstract
We consider the problem of compressing graphs of the link
structure of the World Wide Web. We provide efficient algorithms for
such compression that are motivated by random graph models for
describing the Web. The algorithms are based on reducing the compression
problem to the problem of finding a minimum spanning free in a directed
graph related to the original link graph. The performance of the
algorithms on graphs generated by the random graph models suggests that
by taking advantage of the link structure of the Web, one may achieve
significantly better compression than natural Huffman-based schemes. We
also provide hardness results demonstrating limitations on natural
extensions of our approach
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
