Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Inverted file compression through document identifier reassignment
Information Processing and Management: an International Journal
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
Towards Compressing Web Graphs
DCC '01 Proceedings of the Data Compression Conference
Compressing the Graph Structure of the Web
DCC '01 Proceedings of the Data Compression Conference
Assigning document identifiers to enhance compressibility of Web Search Engines indexes
Proceedings of the 2004 ACM symposium on Applied computing
Concentration for Independent Permutations
Combinatorics, Probability and Computing
The WebGraph Framework II: Codes For The World-Wide Web
DCC '04 Proceedings of the Conference on Data Compression
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
New Approximation Techniques for Some Linear Ordering Problems
SIAM Journal on Computing
Discovering large dense subgraphs in massive graphs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A scalable pattern mining approach to web graph compression with communities
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Introduction to Information Retrieval
Introduction to Information Retrieval
Sorting out the document identifier assignment problem
ECIR'07 Proceedings of the 29th European conference on IR research
On compressing the textual web
Proceedings of the third ACM international conference on Web search and data mining
Proceedings of the 19th international conference on World wide web
A compact representation of graph databases
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Fast nearest-neighbor search in disk-resident graphs
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Neighbor query friendly compression of social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Multiscale approach for the network compression-friendly ordering
Journal of Discrete Algorithms
Proceedings of the 20th international conference on World wide web
GBASE: a scalable and general graph management system
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
SCENT: Scalable compressed monitoring of evolving multirelational social networks
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special section on ACM multimedia 2010 best paper candidates, and issue on social media
Robustness of social networks: comparative results based on distance distributions
SocInfo'11 Proceedings of the Third international conference on Social informatics
Practical representations for web and social graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
gSketch: on query estimation in graph streams
Proceedings of the VLDB Endowment
Optimizing K2 trees: A case for validating the maturity of network of practices
Computers & Mathematics with Applications
Compact rich-functional binary relation representations
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Extended compact web graph representations
Algorithms and Applications
Query preserving graph compression
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
Non-negative residual matrix factorization: problem definition, fast solutions, and applications
Statistical Analysis and Data Mining
Parallel and I/O efficient set covering algorithms
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
gbase: an efficient analysis platform for large graphs
The VLDB Journal — The International Journal on Very Large Data Bases
PowerGraph: distributed graph-parallel computation on natural graphs
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
GraphChi: large-scale graph computation on just a PC
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Compressed representation of web and social networks via dense subgraphs
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Four Degrees of Separation, Really
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Big graph mining: algorithms and discoveries
ACM SIGKDD Explorations Newsletter
Restreaming graph partitioning: simple versatile algorithms for advanced balancing
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
WTF: the who to follow service at Twitter
Proceedings of the 22nd international conference on World Wide Web
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
Efficient estimation for high similarities using odd sketches
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be compressed. Boldi and Vigna (WWW 2004), showed that Web graphs can be compressed down to three bits of storage per edge; we study the compressibility of social networks where again adjacency queries are a fundamental primitive. To this end, we propose simple combinatorial formulations that encapsulate efficient compressibility of graphs. We show that some of the problems are NP-hard yet admit effective heuristics, some of which can exploit properties of social networks such as link reciprocity. Our extensive experiments show that social networks and the Web graph exhibit vastly different compressibility characteristics.