The Trinity project has been presented as a general purpose graph computation that tackles the challenge of random data access. Trinity is designed as a general purpose distributed graph system to run over a memory cloud which is a globally addressable, in-memory key-value store over a cluster of machines. Trinity can run in both embedded (in-process) and distributed mode. It provides declarative graph modeling utilities and declarative network communication modeling utilities. It relies on intuitive object-oriented data manipulation and message passing interfaces. The below figure illustrates the architecture of the trinity project.
There has been error in communication with Booktype server. Not sure right now where is the problem.
You should refresh this page.