Hi guys! )
My graph consists nodes labeled as :Book. In application I have to present
table of books in paged manner and with sorting capabilities by various
properties, for example:
MATCH (b:Book) RETURN b ORDER BY *b.isbn* SKIP {offset} LIMIT {
booksPerPage}
MATCH (b:Book) RETURN b ORDER BY *b.title* SKIP {offset} LIMIT {
booksPerPage}
MATCH (b:Book) RETURN b ORDER BY *b.pubDate* SKIP {offset} LIMIT {
booksPerPage}
// ... and so on...
It is supposed to have very much books (100,000 and more).
Questions:
1. Does execution of previous queries imply loading ALL books in memory and
linear processing for further ordering?
2. What can I do to decrease memory consumption and performance of
execution of such queries in Neo4j 2.0/2.1? (indexing or something else)
3. What is planned to improve this situation in future releases of Neo4j?
I really loved Neo4j and graph databases and I don't want to switch back to
RDBMS just to resolve data access pattern described above.
Thanks!
--
You received this message because you are subscribed to the Google Groups
"Neo4j" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to neo4j+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
