Processes a trillion edge graph without touching main memory

Korean research institute Kaist has found a way to develop a one trillion edge graph algorithm on a single computer without storing the graph in the main memory or on disc. ‘Develop’ is the important word here, as the research covers honing algorithms on synthetic data sets rather than on real big data. “Graphs are ...
This story continues at Processes a trillion edge graph without touching main memory
Or just read more coverage at Electronics Weekly