Practical representations for web and social graphs

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2011, Pages 1185-1190

  Claude, Francisco ^a   Ladra, Susana ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

social networks; web graphs

Indexed keywords

EXTERNAL MEMORY; INTRA-DOMAIN; MAIN MEMORY; SOCIAL GRAPHS; SOCIAL NETWORKS; SPACE AND TIME; STATE OF THE ART; SUBGRAPHS; WEB GRAPHS; WORST CASE;

GRAPHIC METHODS; KNOWLEDGE MANAGEMENT; SOCIAL NETWORKING (ONLINE);

TREES (MATHEMATICS);

EID: 83055179446     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063747     Document Type: Conference Paper

References (22)

1. A. Apostolico and G. Drovandi. Graph compression by BFS. Algorithms, 2(3):1031-1044, 2009.
2. J. Barbay, T. Gagie, G. Navarro, and Y. Nekrich. Alphabet partitioning for compressed rank/select and applications. In Proc. ISAAC, LNCS 6507, pages 315-326. Springer, 2010. Part II.
3. P. Boldi, B. Codenotti, M. Santini, and S. Vigna. Ubicrawler: A scalable fully distributed web crawler. Software: Practice & Experience, 34(8):711-726, 2004.
4. P. Boldi, M. Santini, and S. Vigna. Permuting Web graphs. In Proc. WAW, pages 116-126, 2009.
5. P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In Proc. WWW, pages 595-601, 2004.
6. N. Brisaboa, S. Ladra, and G. Navarro. Directly addressable variable-length codes. In Proc. SPIRE, LNCS 5721, pages 122-130. Springer, 2009.
7. N. Brisaboa, S. Ladra, and G. Navarro. K2-trees for compact web graph representation. In Proc. SPIRE, LNCS 5721, pages 18-30. Springer, 2009.
8. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan. On compressing social networks. In Proc. KDD, pages 219-228. ACM, 2009.
9. F. Claude and G. Navarro. Practical rank/select queries over arbitrary sequences. In Proc. SPIRE, LNCS 5280, pages 176-187, 2008.
10. F. Claude and G. Navarro. Extended compact web graph representations. In Algorithms and Applications (Ukkonen Festschrift), LNCS 6060, pages 77-91, 2010.
11. F. Claude and G. Navarro. Fast and compact web graph representations. ACM Transactions on the Web, 4(4):article 16, 2010.
12. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms, 3(2):article 20, 2007.
13. A. Golynski, I. Munro, and S. Rao. Rank/select operations on large alphabets: a tool for text indexing. In Proc. SODA, pages 368-373, 2006.
14. R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In Proc. SODA, pages 841-850, 2003.
15. G. Jacobson. Space-efficient static trees and graphs. In Proc. SFCS, pages 549-554, 1989.
16. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The Web as a graph: Measurements, models, and methods. In Proc. COCOON, LNCS 1627, pages 1-17, 1999.
17. S. Ladra. Algorithms and Compressed Data Structures for Information Retrieval. PhD thesis, Department of Computer Science, University of A Coruña, 2011.
18. J. Larsson and A. Moffat. Off-line dictionary-based compression. Proceedings of the IEEE, 88(11):1722-1732, 2000.
19. V. Mäkinen and G. Navarro. Rank and select revisited and extended. Theoretical Computer Science, 387:332-347, 2007. (Pubitemid 350001348)
20. H. Maserrat and J. Pei. Neighbor query friendly compression of social networks. In Proc. KDD, pages 533-542. ACM, 2010.
21. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, November 1999.
22. H. Saito, M. Toyoda, M. Kitsuregawa, and K. Aihara. A large-scale study of link spam detection by graph algorithms. In Proc. AIRWeb. ACM Press, 2007.