Fast construction of compressed web graphs

DOI10.1007/978-3-319-67428-5_11MaRDI QIDQ5150926zbMATH OpenOpenAlexFDO

Authors Jan Broß, Simon Gog, Matthias Hauck, Marcus Paradies

Publication date 16 February 2021

Published in String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-67428-5_11

zbMATH Keywords

graph compressionweb graphscompact data structures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Extended compact web graph representations
• Tight and simple web graph compression for forward and reverse neighbor queries
• Speeding up algorithms on compressed web graphs
• Graph compression by BFS
• Efficient Compression of Web Graphs

Cites work

• Extended compact web graph representations
• Graph compression by BFS
• PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS

Cited in

(5)

• Querying websites using compact skeletons.
• Models for the Compressible Web
• Compact structure for sparse undirected graphs based on a clique graph partition
• Speeding up algorithms on compressed web graphs
• Extended compact web graph representations

Describes a project that uses

Uses Software

• GraphChi
• BUbiNG
• WebGraph
• Pregel
• UbiCrawler
• MCSTL
• STXXL

This page was built for publication: Fast construction of compressed web graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150926)