97 citations · 438 across the 36 of their papers we have counts for
6 papers · 1 filter
Theoretically-Efficient and Practical Parallel DBSCAN
Yiqiu Wang, Yan Gu, Julian Shun
The DBSCAN method for spatial clustering has received significant attention due to its applicability in a variety of data analysis tasks. There are fast sequential algorithms for D…
Optimizing Ordered Graph Algorithms with GraphIt
Yunming Zhang, Ajay Brahmakshatriya, Xinyi Chen +4
Many graph problems can be solved using ordered parallel graph algorithms that achieve significant speedup over their unordered counterparts by reducing redundant work. This paper…
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
Laxman Dhulipala, Charlie McGuffey, Hongbo Kang +4
Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved mem…
Parallel Algorithms for Butterfly Computations
Jessica Shi, Julian Shun
Butterflies are the smallest non-trivial subgraph in bipartite graphs, and therefore having efficient computations for analyzing them is crucial to improving the quality of certain…
Kaskade: Graph Views for Efficient Graph Analytics
Joana M. F. da Trindade, Konstantinos Karanasos, Carlo Curino +2
Graphs are an increasingly popular way to model real-world entities and relationships between them, ranging from social networks to data lineage graphs and biological datasets. Que…
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees
Laxman Dhulipala, Julian Shun, Guy Blelloch
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…