Filters








143 Hits in 3.1 sec

The webgraph framework I

P. Boldi, S. Vigna
2004 Proceedings of the 13th conference on World Wide Web - WWW '04  
The results of all iterators are then merged.Conclusions◮ WebGraph combines new codes, new insights on the structure of the Web graph and new algorithmic techniques to achieve a very high compression ratio  ...  to re-create a given one.Paolo Boldi, Sebastiano VignaDSI, Università di Milano, Italy The WebGraph Framework:Compression Techniques  ... 
doi:10.1145/988672.988752 dblp:conf/www/BoldiV04 fatcat:mq6mjiu5onhz7f77sqmlj3ap2u

About Graph Index Compression Techniques

Antonio Cruciani, Daniele Pasquini, Amati Giambattista, Paola Vocca
2019 Zenodo  
We perform a preliminary study on large graph efficient indexing using a gap-based compression techniques and different node labelling functions.  ...  As baseline we use the Webgraph + LLP labelling function.  ...  We show an example of this technique: Let {i 1 , i 2 , i 3 , i 4 , . . .} be the adjacency list of a node x, then the d-Gap encoding is {i 1 , i 2 −i 1 , i 3 − i 2 , i 4 − 1 3 , . . .}.  ... 
doi:10.5281/zenodo.3836029 fatcat:5huifa64mfgdvkale27wmc2pzy

Zuckerli: A New Compressed Representation for Graphs [article]

Luca Versari, Iulia M. Comsa, Alessio Conte, Roberto Grossi
2020 arXiv   pre-print
Zuckerli improves multiple aspects of WebGraph, the current state-of-the-art in compressing real-world graphs, by using advanced compression techniques and novel heuristic graph algorithms.  ...  It can produce both a compressed representation for storage and one which allows fast direct access to the adjacency lists of the compressed graph without decompressing the entire graph.  ...  WebGraph is the graph compression technique most directly related to Zuckerli, as it uses the above properties.  ... 
arXiv:2009.01353v1 fatcat:vfwhk6l5cvgd7jirzxeqzexoxq

Zuckerli: A New Compressed Representation for Graphs

Luca Versari, Iulia M. Comsa, Alessio Conte, Roberto Grossi
2020 IEEE Access  
ACKNOWLEDGEMENTS We wish to thank Paolo Boldi and Sebastiano Vigna for useful conversations on the topic.  ...  This work was partially supported by the Italian Ministry of University and Research (MIUR) under PRIN Project n. 20174LF3T8 AHeAD (Efficient Algorithms for HArnessing Networked Data).  ...  Among the numerous proposals, the WebGraph framework [2] , [3] is widely recognized as the touchstone for its outstanding compression ratio.  ... 
doi:10.1109/access.2020.3040673 fatcat:2mfppk2su5d4lns5g7uu4kbvym

Delta-K 2-tree for Compact Representation of Web Graphs [chapter]

Yu Zhang, Gang Xiong, Yanbing Liu, Mengya Liu, Ping Liu, Li Guo
2014 Lecture Notes in Computer Science  
In addition, we design a node reordering algorithm to further improve the compression ratio. We compare our approach with the state-of-the-art algorithms, including K 2 -tree, WebGraph, and AD.  ...  In the literature, K 2 -tree can efficiently compress the web graphs while supporting fast querying in the compressed data.  ...  The most influential representative in this trend is WebGraph [9] framework.  ... 
doi:10.1007/978-3-319-11116-2_24 fatcat:u237d7hhdvedfc5bfrvaly7q74

Permuting Web and Social Graphs

Paolo Boldi, Massimo Santini, Sebastiano Vigna
2009 Internet Mathematics  
Our experiments are made in the WebGraph framework [3] , and show that the compression technique and the structure of the graph can produce significantly different results.  ...  Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usually expressed as the number  ...  Conclusions We have presented some experiments about the effect of permutations on the compression of web graphs and social networks.  ... 
doi:10.1080/15427951.2009.10390641 fatcat:urnthxifszarnor5neant2rpwa

Exploiting Computation-Friendly Graph Compression Methods [article]

Alexandre P. Francisco, Travis Gagie, Susana Ladra, Gonzalo Navarro
2018 arXiv   pre-print
In particular, we show that the format of Boldi and Vigna allows computing the product in time proportional to the compressed graph size.  ...  In this paper we show that some well-known Web and social graph compression formats are computation-friendly, in the sense that they allow boosting the computation.  ...  The reference r i is found in the WebGraph framework within a given window W , i.e., r i ∈ {max(1, i − W ), . . . , i}, and it is optimized to reduce the length of the representation of v i .  ... 
arXiv:1708.07271v3 fatcat:6vptsq6ofnfqnlyaerq47jcafu

A Survey on Methods and Systems for Graph Compression [article]

Sebastian Maneth, Fabian Peternek
2015 arXiv   pre-print
We also mention some relevant results from the field of lossy compression and algorithms specialized for the use on large graphs. --- Note: The comparison is by no means complete.  ...  We present an informal survey (meant to accompany another paper) on graph compression methods.  ...  The best compromise of compression and access times is 3.00 bpe with the WebGraph framework and 2.62 bpe using this method, which is then still slightly faster than the WebGraph framework.  ... 
arXiv:1504.00616v1 fatcat:tcznkj6g2vhtnm3x77qsdvl23u

Permuting Web Graphs [chapter]

Paolo Boldi, Massimo Santini, Sebastiano Vigna
2009 Lecture Notes in Computer Science  
Our experiments are made in the WebGraph framework [2] , and show that the compression technique and the structure of the graph can produce significantly different results.  ...  Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usually expressed as the number  ...  WebGraph framework [2] , that still provides the best practical compression techniques.  ... 
doi:10.1007/978-3-540-95995-3_10 fatcat:nahikkrazrca3on5xnzaqtkaxq

GLOUDS: Representing tree-like graphs

Johannes Fischer, Daniel Peters
2016 Journal of Discrete Algorithms  
The Graph Level Order Unary Degree Sequence (GLOUDS) is a new succinct data structure for directed graphs that are "tree-like," in the sense that the number of "additional" edges (w.r.t. a spanning tree  ...  that accounts for the non-tree edges.  ...  Acknowledgements We thank the anonymous reviewers for several helpful suggestions that improved the quality of this article.  ... 
doi:10.1016/j.jda.2015.10.004 fatcat:oa52ery7jrfiberbya3ygkatmm

K-core decomposition of large networks on a single PC

Wissam Khaouid, Marina Barsky, Venkatesh Srinivasan, Alex Thomo
2015 Proceedings of the VLDB Endowment  
Also, we present an accurate implementation of the Batagelj and Zaversnik algorithm for k-core decomposition in Webgraph.  ...  We feature implementations of the "vertex-centric" distributed protocol introduced by Montresor, De Pellegrini and Miorandi on GraphChi and Webgraph.  ...  Webgraph is a graph compression framework that provides an API for accessing a compressed graph using lazy techniques that delay the decompression until it is actually necessary.  ... 
doi:10.14778/2850469.2850471 fatcat:yewvtxmydjhw5maim5s3gd2v74

Graph-XLL: a Graph Library for Extra Large Graph Analytics on a Single Machine

Jian Wu, Venkatesh Srinivasan, Alex Thomo
2019 2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)  
Therefore, in this work, we develop Graph-XLL: a graph library implemented using the WebGraph framework in a vertex-centric manner, with much less memory requirement compared to igraph and NetworkX.  ...  The popular existing graph libraries include the igraph R library and the NetworkX Python library.  ...  WebGraph WebGraph is a highly efficient graph compression framework that allows random access to a memory-mapped compressed graph stored on the hard drive.  ... 
doi:10.1109/iisa.2019.8900744 dblp:conf/iisa/WuST19 fatcat:zfqbpssaeje2bch6zyuvyxhrwm

Compact representation of Web graphs with extended functionality

Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
2014 Information Systems  
Compared to the best representations in the literature supporting successor and predecessor queries, our technique offers the least space usage (1-3 bits per link) while supporting fast navigation to predecessors  ...  The representation is also of general interest and can be used to compress other kinds of graphs and data structures.  ...  We also thank the reviewers for their comments, which improved the quality of the paper.  ... 
doi:10.1016/j.is.2013.08.003 fatcat:bup2nlquxzgz5iedmsteflgaoq

Compressed Representation of Web and Social Networks via Dense Subgraphs [chapter]

Cecilia Hernández, Gonzalo Navarro
2012 Lecture Notes in Computer Science  
We perform experiments using a wide range of web and social networks and compare our results with the best known techniques.  ...  Our results show that we improve the state of the art space/time tradeoffs for supporting neighbor queries.  ...  This reaches the lowest space within the WebGraph framework.  ... 
doi:10.1007/978-3-642-34109-0_28 fatcat:ed225avlxjbqtk73pqbhb2pu3q

k2-Trees for Compact Web Graph Representation [chapter]

Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
2009 Lecture Notes in Computer Science  
Our results show that our method is competitive with the best alternatives in the literature, offering a very good compression ratio (3.3-5.3 bits per link) while permitting fast navigation on the graph  ...  Moreover, it allows for extended functionality not usually considered in compressed graph representations.  ...  Their technique offers better space/time tradeoffs than WebGraph, that is, they offer faster navigation than WebGraph when both structures use the same space. Asano et al.  ... 
doi:10.1007/978-3-642-03784-9_3 fatcat:virfnh2g2zbzbbki3qjaqbojp4
« Previous Showing results 1 — 15 out of 143 results