I'm going to implement OrientDB as our graph database. We won't perform full-text/spatial searches on it, but solely queries like: 'What are the adjacent vertexes of this vertex?'. I know that Lucene is optimised for full-text/spatial searches (which is not appropriate), so this leaves me to index my data with either SB-Tree or 'Hash' (according to https://github.com/orientechnologies/orientdb/wiki/Indexes).
Now my question is what would be the best option for this scenario? Could you explain your answer? Thanks Casper -- --- 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 [email protected]. For more options, visit https://groups.google.com/d/optout.
