Realizing Memory-Optimized Distributed Graph Processing
Explore this paper's citation graph
- Type
- article
- Published
- 2018-04-01
- Cited by
- 9
- References
- 51
- OpenAlex
- https://openalex.org/W2773271555
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:3804068
Keywords
Computer science, Adjacency list, Theoretical computer science, Distributed memory, Graph database
References
- PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs
- Weighted graphs and disconnected components: patterns and a generator
- Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation
- Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+
- GraphChi: Large-Scale Graph Computation on Just a PC
- GPS: a graph processing system
- The webgraph framework I: compression techniques
- Shortest paths algorithms: Theory and experimental evaluation
- Permuting Web and Social Graphs
- A comparison of platforms for implementing and running very large scale machine learning algorithms
- Graph Compression by BFS
- Traversing Binary Trees Simply and Cheaply
- On compressing social networks
- Compression of inverted indexes For fast query evaluation
- Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks
- Compressing Integers for Fast File Access
- Distributed GraphLab: A Framework for Machine Learning in the Cloud
- Graphs over time: densification laws, shrinking diameters and possible explanations
- The Webgraph framework II: codes for the World-Wide Web
- Pushing the Envelope in Graph Compression
Cited by
- DiCeS: Detecting Communities in Network Streams over the Cloud
- Uncovering Local Hierarchical Overlapping Communities at Scale
- FlexGraph: Flexible partitioning and storage for scalable graph mining
- Rapid Detection of Local Communities in Graph Streams
- In-Memory Caching for Enhancing Subgraph Accessibility
- Queryable Compression on Time-evolving Web and Social Networks with Streaming
- ZEKRA: Zero-Knowledge Control-Flow Attestation
- Streaming Local Community Detection Through Approximate Conductance
- Understanding Graph Databases: A Comprehensive Tutorial and Survey
- Graph AI for Fraud Detection: Improving Risk Management and Compliance in Digital Finance
- Causal GNNs and the Anthropology of Data: An Ethical Approach to Fairness and Transparency in Financial AI
Related papers
- An efficient mapping of Boltzmann machine computations onto distributed-memory multiprocessors
- Shared- and distributed-memory parallelization of a Lagrangian atmospheric dispersion model
- A parallel Boltzmann machine on distributed-memory multiprocessors
- Parallelization of a Two-dimensional Compressible Unsteady Navier-Stokes Solver on a Range of MIMD Computers
- A Novel Graph Based Label Propagation Method for Hyperspectral Remote Sensing Data Classification
- The Cost of Eigenvalue Computation on Distributed-Memory MIMD Multiprocessors
- Parallel computation for non-equilibrium dynamics equations using shared memory programming model
- Row Oriented Gauss Elimination on Distributed Memory Multiprocessors