Querying Large Distributed Graphs
This is a research project in the eXtreme Computing Group to enable querying large distributed graphs. We are building a graph library built on top on Orleans that targets hosting very large graphs (billions of nodes and edges) in a data center. The library provides a querying interface to search the graph for matching pathes.
Primary Contact
Jim Larus
DIRECTOR OF SOFTWARE ARCHITECTURE
Team
Academic visitors and collaborators
- Dr. Sherif Sakr, UNSW & NICTA, visiting researcher in 2011.
- Isabelle Stanton, Berkeley, summer intern in 2011.
- Juan Mendivelso, National University of Colombia, summer intern in 2011.
- Mohamed Sarwat, UMN, summer intern in 2010.
- Jiaqing Du, EPFL, summer intern in 2010.
Publications
- Mohamed Sarwat, Sameh Elnikety, Yuxiong He, and Gabriel Kliot, Horton: Online Query Execution Engine for Large Distributed Graphs (Demo Track), in ICDE 2012: 28th IEEE International Conference on Data Engineering, April 2012
- Isabelle Stanton and Gabriel Kliot, Streaming Graph Partitioning for Large Distributed Graphs, no. MSR-TR-2011-121, 8 November 2011
