Matches in SemOpenAlex for { <https://semopenalex.org/work/W2938791877> ?p ?o ?g. }
- W2938791877 abstract "Due to the dynamic nature of real-world graphs, there has been a growing interest in the graph-streaming setting where a continuous stream of graph updates is mixed with arbitrary graph queries. In principle, purely-functional trees are an ideal choice for this setting due as they enable safe parallelism, lightweight snapshots, and strict serializability for queries. However, directly using them for graph processing would lead to significant space overhead and poor cache locality. This paper presents C-trees, a compressed purely-functional search tree data structure that significantly improves on the space usage and locality of purely-functional trees. The key idea is to use a chunking technique over trees in order to store multiple entries per tree-node. We design theoretically-efficient and practical algorithms for performing batch updates to C-trees, and also show that we can store massive dynamic real-world graphs using only a few bytes per edge, thereby achieving space usage close to that of the best static graph processing frameworks. To study the efficiency and applicability of our data structure, we designed Aspen, a graph-streaming framework that extends the interface of Ligra with operations for updating graphs. We show that Aspen is faster than two state-of-the-art graph-streaming systems, Stinger and LLAMA, while requiring less memory, and is competitive in performance with the state-of-the-art static graph frameworks, Galois, GAP, and Ligra+. With Aspen, we are able to efficiently process the largest publicly-available graph with over two hundred billion edges in the graph-streaming setting using a single commodity multicore server with 1TB of memory." @default.
- W2938791877 created "2019-04-25" @default.
- W2938791877 creator A5033930662 @default.
- W2938791877 creator A5051583907 @default.
- W2938791877 creator A5065818820 @default.
- W2938791877 date "2019-04-17" @default.
- W2938791877 modified "2023-09-27" @default.
- W2938791877 title "Low-Latency Graph Streaming Using Compressed Purely-Functional Trees." @default.
- W2938791877 cites W145712316 @default.
- W2938791877 cites W1475732121 @default.
- W2938791877 cites W1476041289 @default.
- W2938791877 cites W1480006450 @default.
- W2938791877 cites W1482680420 @default.
- W2938791877 cites W1506342804 @default.
- W2938791877 cites W1512845581 @default.
- W2938791877 cites W1543897857 @default.
- W2938791877 cites W1593868476 @default.
- W2938791877 cites W1596411313 @default.
- W2938791877 cites W164704629 @default.
- W2938791877 cites W1807272711 @default.
- W2938791877 cites W1881841366 @default.
- W2938791877 cites W1916385248 @default.
- W2938791877 cites W1956410125 @default.
- W2938791877 cites W1957118585 @default.
- W2938791877 cites W1973276585 @default.
- W2938791877 cites W1988144253 @default.
- W2938791877 cites W1994257154 @default.
- W2938791877 cites W1994727615 @default.
- W2938791877 cites W2000041758 @default.
- W2938791877 cites W2008159385 @default.
- W2938791877 cites W2017972843 @default.
- W2938791877 cites W2024042592 @default.
- W2938791877 cites W2034102265 @default.
- W2938791877 cites W2055385473 @default.
- W2938791877 cites W2078210269 @default.
- W2938791877 cites W2080098453 @default.
- W2938791877 cites W2089674328 @default.
- W2938791877 cites W2097805736 @default.
- W2938791877 cites W2098522119 @default.
- W2938791877 cites W2101196063 @default.
- W2938791877 cites W2105045857 @default.
- W2938791877 cites W2120490947 @default.
- W2938791877 cites W2130747448 @default.
- W2938791877 cites W2142947709 @default.
- W2938791877 cites W2144085134 @default.
- W2938791877 cites W2154875162 @default.
- W2938791877 cites W2160459668 @default.
- W2938791877 cites W2170616854 @default.
- W2938791877 cites W2218076943 @default.
- W2938791877 cites W2429966330 @default.
- W2938791877 cites W2492613899 @default.
- W2938791877 cites W2521098462 @default.
- W2938791877 cites W2521218765 @default.
- W2938791877 cites W2523378841 @default.
- W2938791877 cites W2534918852 @default.
- W2938791877 cites W2539828367 @default.
- W2938791877 cites W2557279889 @default.
- W2938791877 cites W2562123954 @default.
- W2938791877 cites W2564843855 @default.
- W2938791877 cites W2574229471 @default.
- W2938791877 cites W2604668004 @default.
- W2938791877 cites W2611081592 @default.
- W2938791877 cites W2612835624 @default.
- W2938791877 cites W2613261966 @default.
- W2938791877 cites W2613361247 @default.
- W2938791877 cites W2739409954 @default.
- W2938791877 cites W2765486566 @default.
- W2938791877 cites W2767135145 @default.
- W2938791877 cites W2783778195 @default.
- W2938791877 cites W2798525482 @default.
- W2938791877 cites W2896032594 @default.
- W2938791877 cites W2901608006 @default.
- W2938791877 cites W2902093742 @default.
- W2938791877 cites W2922946586 @default.
- W2938791877 cites W2963335540 @default.
- W2938791877 cites W2963337971 @default.
- W2938791877 cites W2963806858 @default.
- W2938791877 cites W3105322242 @default.
- W2938791877 cites W3124031623 @default.
- W2938791877 cites W3145128584 @default.
- W2938791877 cites W72241736 @default.
- W2938791877 cites W78077100 @default.
- W2938791877 cites W973024310 @default.
- W2938791877 cites W22572007 @default.
- W2938791877 cites W2798609633 @default.
- W2938791877 hasPublicationYear "2019" @default.
- W2938791877 type Work @default.
- W2938791877 sameAs 2938791877 @default.
- W2938791877 citedByCount "4" @default.
- W2938791877 countsByYear W29387918772019 @default.
- W2938791877 countsByYear W29387918772020 @default.
- W2938791877 countsByYear W29387918772021 @default.
- W2938791877 crossrefType "posted-content" @default.
- W2938791877 hasAuthorship W2938791877A5033930662 @default.
- W2938791877 hasAuthorship W2938791877A5051583907 @default.
- W2938791877 hasAuthorship W2938791877A5065818820 @default.
- W2938791877 hasConcept C115537543 @default.
- W2938791877 hasConcept C132525143 @default.
- W2938791877 hasConcept C138885662 @default.
- W2938791877 hasConcept C173608175 @default.