{"id":170574,"date":"2010-10-14T17:22:32","date_gmt":"2010-10-14T17:22:32","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/project\/horton-querying-large-distributed-graphs\/"},"modified":"2017-06-15T12:02:38","modified_gmt":"2017-06-15T19:02:38","slug":"horton-querying-large-distributed-graphs","status":"publish","type":"msr-project","link":"https:\/\/www.microsoft.com\/en-us\/research\/project\/horton-querying-large-distributed-graphs\/","title":{"rendered":"Horton – Querying Large Distributed Graphs"},"content":{"rendered":"

Horton was a research project\u00a0to enable querying large distributed graphs. It consists of a graph library built on top of Orleans (opens in new tab)<\/span><\/a>that targets hosting large graphs in a data center. The library provides a querying interface to search the graph for matching paths.<\/p>\n

\n

Academic visitors and collaborators<\/h1>\n