Skip to Main content Skip to Navigation
Conference papers

Inverse Space Filling Curve Partitioning Applied to Wide Area Graphs

Abstract : The most recent developments in graph partitioning research often consider scale-free graphs. Instead we focus on partitioning geometric graphs using a less usual strategy: Inverse Spacefilling Partitioning (ISP). ISP relies on a space filling curve to partition a graph and was previously applied to graphs essentially generated from Meshes. We extend ISP to apply it to a new context where the targets are now Wide Area Graphs. We provide an extended comparison with two state-of-the-art graph partitioning streaming strategies, namely LDG and FENNEL. We also propose customized metrics to better understand and identify the use cases for which the ISP partitioning solution is best suited. Experimentations show that in favourable contexts, edge-cuts can be drastically reduced, going from more 34% using FENNEL to less than 1% using ISP.
Complete list of metadata
Contributor : Michel Hurfin Connect in order to contact the contributor
Submitted on : Wednesday, February 10, 2021 - 6:18:16 PM
Last modification on : Friday, January 21, 2022 - 3:10:45 AM
Long-term archiving on: : Tuesday, May 11, 2021 - 9:06:47 PM


Files produced by the author(s)



Cyprien Gottstein, Philippe Raipin Parvedy, Michel Hurfin, Thomas Hassan, Thierry Coupaye. Inverse Space Filling Curve Partitioning Applied to Wide Area Graphs. DMS 2020 - 11th International conference on Database Management Systems, Nov 2020, Zurich, Switzerland. pp.223-241, ⟨10.5121/csit.2020.101417⟩. ⟨hal-03137952⟩



Les métriques sont temporairement indisponibles