Here's Microsoft's explanation of codename Trinity:
"Trinity is a graph database and graph computation platform over distributed memory cloud. At the heart of Trinity is a distributed RAM-based key-value store. As an all-in-memory key-value store, Trinity provides fast random data access. This feature naturally makes Trinity suitable for large graph processing. Trinity is a graph database from the perspective of data management. It is a parallel graph computation platform from the perspective of graph analytics. As a database, it provides features such as data indexing, concurrent query processing, concurrency control. As a computation platform, it provides vertex-based parallel graph computation on large scale graphs."
And here's the requisite architectural diagram:
Trinity is built on top of the distributed memory-storage layer called "memory cloud." Utility tools provided by Trinity include a "fast billion node graph generator," the Trinity Shell and various management tools.
According to the Trinity page, the Trinity code is available only via the Microsoft intranet at this time. So why is it interesting? One potential use of Trinity is people search within a network. The Trinity applications page shows off as an example searching within a "Web-scale social network," like, say, Facebook. Microsoft's Bing search engine can check a user's Facebook network to see if there's anything relevant to pull, but doing so is a massive task which needs to be completed quickly.
In the demo they performed using an example of someone with 130 Facebook friends, this kind of two-hop query could be conducted in 10 milliseconds using Trinity. A three-hop would take 100 ms, the researchers said.