store edges of a node in a sorted manner
Is there any way for me to store the edges of a specific node in a sorted manner?
Is there any Gremlin based database that implements indices perhaps?
Is there any Gremlin based database that implements indices perhaps?
Solution
Is there any way for me to store the edges of a specific node in a sorted manner?to my knowledge none of the common ones will allow that. i dont think most even preserve insertion order for edges.
Is there any Gremlin based database that implements indices perhaps?i assume you are still referring to edges here. Titan-like graphs such as JanusGraph, HugeGraph, etc. and DataStax Graph allow you to explicitly define indices on edges
Apache TinkerPop is an open source graph computing framework and the home of the Gremlin graph query language.
1,376Members
Resources
Similar Threads
Was this page helpful?
