Re: [Neo4j] Relationships stored order
2011/11/4 David Montag david.mon...@neotechnology.com Hi Evgeny, Could you maybe describe the use case behind this requirement a bit more? We use the neo as persistent memory in the new age programming language. Every expression on this language is compiled into graph structure. So we need a graph with sorted relationships. And sort order is equal to the order in which relationships are created (stored). -- Evgeny ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo4j] Relationships stored order
Hello! Is there way to get relationships in the stored order in the neo? -- Evgeny ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] Relationships stored order
2011/10/31 Mattias Persson matt...@neotechnology.com No, are you thinking about ordering them after property value or by type or something else? Just we use a special relationships index for storing the order of relationships. Like: r = node.creareRelationship(parent, type); index.add(r, ORDER, 1); r = node.creareRelationship(parent, type); index.add(r, ORDER, 2); And the query via sort() to get relationships in right order. This way have a very bad performance. So, I have a question, is there a way get the relationships in stored sorted order in neo? If no, I suggest to create optional index (db) on the existing neo's low level storage for this. We can use an external storage (just we use bdb-index for the our key-value cache), but think this like on existing neo's data files, isn't it? -- Evgeny ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] Relationships stored order
PS We don't need a traverse through relationships in stored order, only iterations for start or end node. -- Evgeny ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
