Share on Facebook Tweet on Twitter Share on LinkedIn Share by email

Overview | Tools | Applications | Documents and Publications | Release


What is Trinity?

General purpose graph computation faces a great challenge of random data access. Meanwhile, the RAM capacity limit forms a scale bound of single machine solutions for general purpose graph processing. Trinity is a general purpose distributed graph system over a memory cloud. Memory cloud is a globally addressable, in-memory key-value store over a cluster of machines. Through the distributed in-memory storage, Trinity provides fast random data access power over a large data set. This makes Trinity a natural large graph processing platform. With the power of fast graph exploration and distributed parallel computing, Trinity supports both low-latency online query processing and high-throughput offline analytics on billion-node scale large graphs.

Features of Trinity:

  • Trinity can run in both embedded (in-process) and distributed mode.
  • In-memory data is kept highly compact.
  • Declarative graph modeling utilities.
  • Declarative network communication modeling utilities.
  • Intuitive object-oriented data manipulation and message passing interfaces.
  • Rich system management and development tools.

Project Contacts

Bin Shao
Yatao Li
Liang Chen
Wei-Ying Ma