Band Ordering in Lossless Compression of Multispectral Images
IEEE Transactions on Computers
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
Approximation algorithms for directed Steiner problems
Proceedings of the ninth 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
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Engineering the compression of massive tables: an experimental approach
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Towards Compressing Web Graphs
Towards Compressing Web Graphs
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
ACM Transactions on Internet Technology (TOIT)
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
Compressibility as a Measure of Local Coherence in Web Graphs
IICS '02 Proceedings of the Second International Workshop on Innovative Internet Computing Systems
Proceedings of the 27th International Conference on Very Large Data Bases
A General Model of Undirected Web Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The Link Database: Fast Access to Graphs of the Web
DCC '02 Proceedings of the Data Compression Conference
Index Compression through Document Reordering
DCC '02 Proceedings of the Data Compression Conference
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
WebGraph: things you thought you could not do with Java™
Proceedings of the 3rd international symposium on Principles and practice of programming in Java
Compression of samplable sources
Computational Complexity
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximate maximum weight branchings
Information Processing Letters
Accelerating sparse matrix computations via data compression
Proceedings of the 20th annual international conference on Supercomputing
The Web as a graph: How far we are
ACM Transactions on Internet Technology (TOIT)
A methodology for the evaluation of web graph models and a test case
Proceedings of the 38th conference on Winter simulation
Compressing table data with column dependency
Theoretical Computer Science
Modelling and simulation of the web graph: evaluating an exponential growth copying model
International Journal of Web Engineering and Technology
New technique for data compression
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
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
An Efficient Algorithm and Its Parallelization for Computing PageRank
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
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
Traffic reduction in computer networks by agent technology
HSI'09 Proceedings of the 2nd conference on Human System Interactions
Compression of graphical structures
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Proceedings of the 19th international conference on World wide web
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
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
Multiscale approach for the network compression-friendly ordering
Journal of Discrete Algorithms
Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
Compression of weighted graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
An algorithm for enumerating SCCs in web graph
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Limits and power laws of models for the web graph and other networked information spaces
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
A survey of models of the web graph
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Extended compact web graph representations
Algorithms and Applications
Non-linear compression: Gzip Me Not!
HotStorage'12 Proceedings of the 4th USENIX conference on Hot Topics in Storage and File Systems
Network compression by node and edge mergers
Bisociative Knowledge Discovery
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)
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
X-Stream: edge-centric graph processing using streaming partitions
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Compact representation of Web graphs with extended functionality
Information Systems
| Hi-index | 0.00 |
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 recently proposed random graph models for describing the Web. The algorithms are based on reducing the compression problem to the problem of finding a minimum spanning tree 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.