Database Reference
In-Depth Information
Figures 7-7 and 7-8 show the Titan data layout and edge storage mechanisms. (The
images are from the Titan wiki page at https://github.com/thinkaureli-
us/titan/wiki/Titan-Data-Model and reused under the Apache License,
Version 2.0, www.apache.org/licenses/LICENSE-2.0 . )
Figure 7-7 . Titan's data layout mechanism
Figure 7-8 . Titan's edge storage mechanism
The underlying datastore will store each vertex along with adjoining edges and
properties as a single row. Also these rows will be sorted by vertex id and cells will be
sorted by property and edge key. Dynamic cells can be added at run time. Data colloc-
ation is very important, that's why storing the vertex and adjoining edges as a single
row would help to achieve high availability.
Backend Stores
Titan's storage architecture is totally decoupled and supports multiple NoSQL data-
bases, which are
 
 
 
Search WWH ::




Custom Search