Neighbor query friendly compression of social networks

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 533-541

  Maserrat, Hossein ^a   Pei, Jian ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Compression; Eulerian data structure; MPk linearization; Social networks

Indexed keywords

ADVANCED ANALYSIS; COMPRESSION; COMPRESSION RATES; DIRECTED GRAPHS; EMPIRICAL STUDIES; EULERIAN; MPK LINEARIZATION; NEIGHBOR QUERY; REAL DATA SETS; SOCIAL NETWORKS; SUBLINEAR TIME; THEORETICAL BOUNDS;

DATA STRUCTURES; EUROPIUM; LINEARIZATION; QUERY PROCESSING; SOCIAL NETWORKING (ONLINE);

DATA COMPRESSION;

EID: 77956212442     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835873     Document Type: Conference Paper

References (16)

1. M. Adler and M. Mitzenmacher. Towards compressing web graphs. In Data Compression Conference, 2001.
2. A. Apostolico and G. Drovandi. Graph compression by BFS. Algorithms, 2(3):1031-1044, 2009.
3. P. Boldi, M. Santini, and S. Vigna. Permuting web graphs. In Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (WAW'09), Berlin, Heidelberg, 2009. Springer-Verlag.
4. P. Boldi and S. Vigna. The webgraph framework I: compression techniques. In WWW, 2004.
5. P. Boldi and S. Vigna. The webgraph framework II: Codes for the world-wide web. In Data Compression Conference, 2004.
6. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. J. Comput. Syst. Sci., 60(3):630-659, 2000.
7. G. Buehrer and K. Chellapilla. A scalable pattern mining approach to web graph compression with communities. In WSDM, 2008.
8. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan. On compressing social networks. In KDD, 2009.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
10. J. Díaz, J. Petit, and M. J. Serna. A survey of graph layout problems. ACM Comput. Surv., 34(3):313-356, 2002.
11. C. H. Papadimitriou. The NP-completeness of the bandwidth minimization problem. Computing, 16(3):263-270, 1976.
12. S. Raghavan and H. Garcia-Molina. Representing web graphs. In ICDE, 2003.
13. K. H. Randall, R. Stata, J. L. Wiener, and R. Wickremesinghe. The link database: Fast access to graphs of the web. In DCC, 2002.
14. K. F. Stanley Wasserman. Social networks analysis: Methods and Applications. Cambridge Press, 1994.
15. T. Suel and J. Yuan. Compressing the graph structure of the web. In Data Compression Conference, 2001.
16. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small world' networks. Nature, 393(6684):440-442, 1998.