The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
The connectivity server: fast access to linkage information on the Web
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Digital Image Compression: Algorithms and Standards
Digital Image Compression: Algorithms and Standards
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient and Simple Encodings for the Web Graph
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Compressing the Graph Structure of the Web
DCC '01 Proceedings of the Data Compression Conference
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework
IEICE - Transactions on Information and Systems
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Improvements of HITS algorithms for spam links
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
A fast and compact web graph representation
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
k2-Trees for Compact Web Graph Representation
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Fast and Compact Web Graph Representations
ACM Transactions on the Web (TWEB)
Extended compact web graph representations
Algorithms and Applications
Compact representation of Web graphs with extended functionality
Information Systems
Tight and simple Web graph compression for forward and reverse neighbor queries
Discrete Applied Mathematics
| Hi-index | 0.00 |
Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.