Graph compression by BFS (Q1662490): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3390/a2031031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018900730 / rank | |||
Normal rank | |||
Revision as of 19:02, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph compression by BFS |
scientific article |
Statements
Graph compression by BFS (English)
0 references
20 August 2018
0 references
Summary: The \textit{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.
0 references
data compression
0 references
web graph
0 references
graph compression
0 references
breadth-first search
0 references
universal codes
0 references
