Short encodings of planar graphs and maps
Discrete Applied Mathematics
Enhanced hypertext categorization using hyperlinks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Improved algorithms for topic distillation in a hyperlinked environment
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
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
Focused crawling: a new approach to topic-specific Web resource discovery
WWW '99 Proceedings of the eighth international conference on World Wide Web
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
External memory algorithms and data structures
External memory algorithms
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Mining the Web's Link Structure
Computer
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Distributed Hypertext Resource Discovery Through Examples
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficient Lossless Compression of Trees and Graphs
DCC '96 Proceedings of the Conference on Data Compression
Information Retrieval on the Web
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Towards Compressing Web Graphs
DCC '01 Proceedings of the Data Compression Conference
I/O-efficient techniques for computing pagerank
Proceedings of the eleventh international conference on Information and knowledge management
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Link Database: Fast Access to Graphs of the Web
DCC '02 Proceedings of the Data Compression Conference
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
High performance crawling system
Proceedings of the 6th ACM SIGMM international workshop on Multimedia information retrieval
WebGraph: things you thought you could not do with Java™
Proceedings of the 3rd international symposium on Principles and practice of programming in Java
Accelerating sparse matrix computations via data compression
Proceedings of the 20th annual international conference on Supercomputing
Characterization of national Web domains
ACM Transactions on Internet Technology (TOIT)
Graph summarization with bounded error
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
The very small world of the well-connected
Proceedings of the nineteenth ACM conference on Hypertext and hypermedia
Efficient Compression of Web Graphs
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The very small world of the well-connected
ACM SIGWEB Newsletter
On compressing social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 20th ACM conference on Hypertext and hypermedia
k2-Trees for Compact Web Graph Representation
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
GConnect: a connectivity index for massive disk-resident graphs
Proceedings of the VLDB Endowment
Traffic reduction in computer networks by agent technology
HSI'09 Proceedings of the 2nd conference on Human System Interactions
Implementation of a web robot and statistics on the Korean web
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
A fast and compact web graph representation
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Neighbor query friendly compression of social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast and Compact Web Graph Representations
ACM Transactions on the Web (TWEB)
Succinct representations of separable graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Compressed string dictionaries
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Scalable manipulation of archival web graphs
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Of hammers and nails: an empirical comparison of three paradigms for processing large graphs
Proceedings of the fifth ACM international conference on Web search and data mining
Extended compact web graph representations
Algorithms and Applications
Breaking the speed and scalability barriers for graph exploration on distributed-memory machines
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Evaluation of a Hybrid Approach for Efficient Provenance Storage
ACM Transactions on Storage (TOS)
Compact representation of Web graphs with extended functionality
Information Systems
| Hi-index | 0.00 |
Abstract: A large amount of research has recently focused on the graph structure (or link structure) of the World Wide Web. This structure has proven to be extremely useful for improving the performance of search engines and other tools for navigating the web. However, since the graphs in these scenarios involve hundreds of millions of nodes and even more edges, highly space-efficient data structures are needed to fit the data in memory. A first step in this direction was done by the DEC Connectivity Server, which stores the graph in compressed form. In this paper, we describe techniques for compressing the graph structure of the web, and give experimental results of a prototype implementation. We attempt to exploit a variety of different sources of compressibility of these graphs and of the associated set of URLs in order to obtain good compression performance on a large web graph.