Hello, Storing order required because it's fundamental structure property.
If I do type "get (title) (book)" that always should be "title from book" & never "book from title" because meaning are different (but second expression is also valid). As you can see both expressions are valid but have different evaluation results. Graph created for that expressions is this (simplified): node(get) -> link -> node(title) & node(get) -> link -> node(book) , note that node(get) is same node. Now, if query node(get) for children order should be counted: 1 relationship to node(title), 2 relationship to node(book) This is "down order" requirement, but there also "up order" one. The graph is compressing on fly, so that mean that "get (title) (book)" & "get (author) (book)" sharing node(book). Same time from node(book) it should be possible to go back to node(get). Remember that there are two node(get) and "up order" procedure must find correct one. For now we using lucene and preparing berkeley db index, but interesting to search for better performance too. On Fri, Nov 4, 2011 at 4:56 AM, David Montag <[email protected] > wrote: > Do they need to be sorted because of some arbitrary reason, or because > you're storing data structures like lists that you want to preserve the > order of? > > David > > On Thu, Nov 3, 2011 at 4:44 PM, Evgeny Gazdovsky <[email protected] > >wrote: > > > 2011/11/4 David Montag <[email protected]> > > > > > 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). > > > -- Dmitriy Shabanov _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
