Hi, thanks, i have created a small sample data model (see attached jpg) mapping the neo4j datamodel as i understand it onto a google bigtable datamodel with one table and a few famililies grouped by property type (string etc ) , node type (for relations) and related nodes (for relations)
every new node / relation becomes a record with one or more properties and in case of a relation related nodes ... a bigtable sorts them on the row-key
in principle i assume it will fit this way onto google bigtable ... but i have no clue yet if practically this is modelled the right way
one could also look at it from 90 degrees and place attributes as rows and nodes / relations as famulity attributes ..
although i guess a bigtable is most efficient when one record is written at a time for a certain change... so i assume my model would be preferred..
using a google bigtable a data storage would give immense distributed scaleability i guess
any thoughts on my model ?
reg koen
Op maandag 27 augustus 2012 20:15:50 UTC+2 schreef Koen het volgende: