Graph Compression by BFS
The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of t...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2009-08-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1999-4893/2/3/1031/ |
| id |
doaj-1e6e07f9148241d9a4007991ed125619 |
|---|---|
| record_format |
Article |
| spelling |
doaj-1e6e07f9148241d9a4007991ed1256192020-11-25T00:27:52ZengMDPI AGAlgorithms1999-48932009-08-01231031104410.3390/a2031031Graph Compression by BFSAlberto ApostolicoGuido DrovandiThe Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods. http://www.mdpi.com/1999-4893/2/3/1031/data compressionweb graphgraph compressionbreadth first searchuniversal codes |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Alberto Apostolico Guido Drovandi |
| spellingShingle |
Alberto Apostolico Guido Drovandi Graph Compression by BFS Algorithms data compression web graph graph compression breadth first search universal codes |
| author_facet |
Alberto Apostolico Guido Drovandi |
| author_sort |
Alberto Apostolico |
| title |
Graph Compression by BFS |
| title_short |
Graph Compression by BFS |
| title_full |
Graph Compression by BFS |
| title_fullStr |
Graph Compression by BFS |
| title_full_unstemmed |
Graph Compression by BFS |
| title_sort |
graph compression by bfs |
| publisher |
MDPI AG |
| series |
Algorithms |
| issn |
1999-4893 |
| publishDate |
2009-08-01 |
| description |
The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods. |
| topic |
data compression web graph graph compression breadth first search universal codes |
| url |
http://www.mdpi.com/1999-4893/2/3/1031/ |
| work_keys_str_mv |
AT albertoapostolico graphcompressionbybfs AT guidodrovandi graphcompressionbybfs |
| _version_ |
1725337947092287488 |