<https://lh6.googleusercontent.com/-3kxe0NVCMgA/VA8owdhVh6I/AAAAAAAAAC0/eJXwBRgoXwU/s1600/graph.png> hello i have a simple Graph structure and i want to find a best graph DB solution for this :
in this graph structure i just have simple nodes (a BigInt(64bit) value and a String value ) data in any node/vertex and just i have 2 types of edge child and father every node could to have several child and several father but you see between 2 nodes always i have this 2 relational edges (child and father) and nothing more Graph DB must be could to fetch all data in the ram (cached) and in the HDD/SSD (file) depended on working strategy i want to choice having a cache for all data or no ( dont think for RAM value) Graph DB must be could to run in distributed mode because data growing up and i have more than 4 billion nodes now and more query is just what are a node having children and or fathers i dont have any data analyzing , page rank , or any computing on data in DB level ( i mean i dont need mapreduce or so on ) performance is one of important thing in this system , this structure is very more readable , rate is 99.9% reading according to 0.1% writing so must be have very good performance please say your opinion without having any bias on DB :) thank you -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to orient-database+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
