Does it include (or have planned) any features relating to full text search, more specifically for mixing ranking/search with graph queries?
One use case I have (solved by some current graph DBs) is performing a complex full text search (boolean operators, stopword removal, fuzzy matching etc.), which alters search ranking based on graph properties (e.g. a node with more edges might get a reduction in score, the root of a tree might get a boost, etc.).
I'm still going through the tutorial, so haven't got to grips with what the DB is capable of yet.
One use case I have (solved by some current graph DBs) is performing a complex full text search (boolean operators, stopword removal, fuzzy matching etc.), which alters search ranking based on graph properties (e.g. a node with more edges might get a reduction in score, the root of a tree might get a boost, etc.).
I'm still going through the tutorial, so haven't got to grips with what the DB is capable of yet.