k2-trees for compact web graph representation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5721 LNCS, Issue , 2009, Pages 18-30

  Brisaboa, Nieves R ^a   Ladra, Susana ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; COMPACT TREE; COMPRESSION RATIOS; GRAPH REPRESENTATION; WEB GRAPHS;

COMPRESSION RATIO (MACHINERY); INFORMATION RETRIEVAL; INFORMATION SERVICES; TOWERS;

GRAPH THEORY;

EID: 70350633188     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03784-9_3     Document Type: Conference Paper

References (24)

1. Adler, M., Mitzenmacher, M.: Towards compressing Web graphs. In: Proc. 11th DCC, pp. 203-212 (2001)
2. Asano, Y., Miyawaki, Y., Nishizeki, T.: Efficient compression of web graphs. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 1-11. Springer, Heidelberg (2008)
3. Barbay, J., He, M., Munro, I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proc. 18th SODA, pp. 680-689 (2007)
4. Benoit, D., Demaine, E., Munro, I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275-292 (2005)
5. Bharat, K., Broder, A., Henzinger, M., Kumar, P., Venkatasubramanian, S.: The Connectivity Server: Fast access to linkage information on the Web. In: Proc. 7th WWW, pp. 469-477 (1998)
6. Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proc. 13th WWW, pp. 595-601. ACM Press, New York (2004)
7. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web. Journal of Computer Networks 33(1-6), 309-320 (2000); also in Proc. 9th WWW
8. Chan, H.-L., Hon, W.-K., Lam, T.-W., Sadakane, K.: Compressed indexes for dynamic text collections. ACM Transactions on Algorithms 3(2), article 21 (2007)
9. Claude, F.: Compressed data structures for Web graphs. Master's thesis, Dept. of Comp. Sci., Univ. of Chile, Advisor: Navarro, G., TR/DCC-2008-12 (August 2008)
10. Claude, F., Navarro, G.: A fast and compactWeb graph representation. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 105-116. Springer, Heidelberg (2007)
11. Donato, D., Millozzi, S., Leonardi, S., Tsaparas, P.: Mining the inner structure of the Web graph. In: Proc 8th WebDB, pp. 145-150 (2005)
12. Geary, R., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. Theoretical Computer Science 368(3), 231-246 (2006)
13. González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proc. 4th WEA, pp. 27-38 (2005)
14. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549-554 (1989)
15. Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees. In: Proc. 18th SODA, pp. 575-584 (2007)
16. Kleinberg, J., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: The Web as a graph: Measurements, models, and methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 1-17. Springer, Heidelberg (1999)
17. Larsson, J., Moffat, A.: Off-line dictionary-based compression. Proc. IEEE 88(11), 1722-1732 (2000)
18. Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
19. Munro, I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing 31(3), 762-776 (2001)
20. Raghavan, S., Garcia-Molina, H.: Representing Web graphs. In: Proc. 19th ICDE, p. 405 (2003)
21. Randall, K., Stata, R., Wickremesinghe, R., Wiener, J.: The LINK database: Fast access to graphs of the Web. Technical Report 175, Compaq SRC (2001)
22. Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., San Francisco (2006)
23. Suel, T., Yuan, J.: Compressing the graph structure of the Web. In: Proc. 11th DCC, pp. 213-222 (2001)
24. Vitter, J.: External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys 33(2), 209-271 (2001) (Version revised at 2007)