![]() KeywordsĪpostolico, A., Drovandi, G.: Graph compression by BFS. We show the practicality of the latter version by constructing partitioned hybrid k-trees for Web graphs in the scale of a billion nodes and up to 100 billion edges. We also engineer a parallel version, which fully utilizes all CPUs and caches. We show that algorithms based on the Z-order sorting reduce the memory footprint significantly and at the same time are faster than previous approaches. In this paper, we engineer the construction of regular and hybrid \(k^2\)-trees. ![]() ![]() While much effort was spent on finding space-efficient and fast representations, one issue was only partially addressed: developing resource-efficient construction algorithms. Today, all these representations are highly relevant in practice since they enable to keep large-scale web and social graphs in the main memory of a single machine and consequently facilitate fast random access to nodes and edges. Several compressed graph representations were proposed in the last 15 years. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |