HI there.
I will make some feed system and i wanna realtime sorting for user like
count.
Author -- Follow --> Author.
Author -- Write ---> Article.
Author -- Like --> Article
When i Quering like "out('Follow').out('Write').in('Like').size()" is too
slow.
So i modify Article to had likeCount.
query chaged to
SELECT out('Follow').out('Write').likeCount FROM Author where name =
'author_1' ORDER by likeCount DESC.
This query is faster than last query.
But I need more faster to realtime sorting.
Can I store all graph vertex and edge in memory with distributed Graph
Database?
Include hardware write.
I found this(OrientDB &
Hazelcast, https://www.youtube.com/watch?v=FfcLWgLcka0)
It explaned distributed, right? I cannot find where is In-memory.
--
---
You received this message because you are subscribed to the Google Groups
"OrientDB" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
