Graph compression by BFS (Q1662490)

From MaRDI portal
Revision as of 21:00, 24 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graph compression by BFS
scientific article

    Statements

    Graph compression by BFS (English)
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references