Thanks.
> Can I achieve something similar with Gremlin?
What is the problem you are trying to solve. In Gremlin, there is the aggregate step and you can conditions pre-aggregation and projections/selections post-aggregateion. If you provide me, perhaps in human language what you are trying to express, I can tell you the respective Gremlin query.
Thanks,
Marko.
START c=node(some_category_id)MATCH c<-[:categorized]-u-[:like]->itemWHERE count(*) >= 3RETURN item, count(*)ORDER BY count(*) DESC
What happens if I do a sort on that field as well? I want the users that have most likes..sort { -it.out('likes').count() }will iterate on all?
> Is there a more efficient way for this, except caching the counts on my own as a property of the node?
A more efficient way to do what? Please leave the thread of communication so I can remember what we talked about. Also, provide your query so I can see how to optimize it.
Thanks,
Marko.