Single-node partitioned-memory for huge graph analytics: cost and performance trade-offs.
Sayan GhoshNathan R. TallentMarco MinutoliMahantesh HalappanavarRamesh PeriAnanth KalyanaramanPublished in: SC (2021)
Keyphrases
- trade off
- storage overhead
- random walk
- data management
- structured data
- graph theory
- memory requirements
- high cost
- business intelligence
- main memory
- graph search
- graph representation
- graph structure
- case study
- internal memory
- directed acyclic graph
- bipartite graph
- spanning tree
- memory usage
- weighted graph
- learning analytics
- directed graph
- connected components
- cost sensitive
- graph theoretic
- expected cost
- path length
- limited memory
- graphical models
- social media
- bayesian networks