HISC/R: An Efficient Hypersparse-Matrix Storage Format for Scalable Graph Processing.
Robert KirchgessnerGiovanni De La TorreAlan D. GeorgeVitaliy GleyzerPublished in: IA3@SC (2016)
Keyphrases
- processing capabilities
- adjacency matrix
- real time
- memory efficient
- random access
- graph theory
- graph theoretic
- weighted graph
- storage and retrieval
- highly efficient
- graph representation
- markov chain
- low latency
- xml processing
- storage requirements
- graph structure
- bipartite graph
- directed graph
- connected components
- transition matrix
- matrix representation
- eigenvalues and eigenvectors
- similarity matrix
- low rank
- data processing
- xml documents
- multimedia