You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tinkerpop.apache.org by "Marko A. Rodriguez (JIRA)" <ji...@apache.org> on 2015/10/07 22:20:26 UTC
[jira] [Updated] (TINKERPOP3-872) Remove GroupCountStep in favor of
new Reduce-based GroupStep
[ https://issues.apache.org/jira/browse/TINKERPOP3-872?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Marko A. Rodriguez updated TINKERPOP3-872:
------------------------------------------
Description:
Check it. In the {{group_step_2/}} branch, we can now do this efficiently as we now support "on the fly" reduction.
{code}
gremlin> g.V().both().both().group().by('name').by(count())
==>[ripple:3, peter:3, vadas:3, josh:7, lop:7, marko:7]
gremlin> g.V().both().both().groupCount().by('name')
==>[ripple:3, peter:3, vadas:3, josh:7, lop:7, marko:7]
{code}
Now, stand back...
{code}
gremlin> clock(10000){g.V().both().both().groupCount().by('name').next()}
==>0.0415874797
gremlin> clock(10000){g.V().both().both().group().by('name').by(count()).next()}
==>0.08681611759999999
{code}
Speed differences are reasonable and I know various places in the new {{GroupStep}} that I can optimize to make more efficient.
And that is how the dishes get done.
was:
Check it. In the {{group_step_2/}} branch, we can now do this efficiently as we now support "on the fly" reduction.
{code}
gremlin> g.V().both().both().group().by('name').by(count())
==>[ripple:3, peter:3, vadas:3, josh:7, lop:7, marko:7]
gremlin> g.V().both().both().groupCount().by('name')
==>[ripple:3, peter:3, vadas:3, josh:7, lop:7, marko:7]
{code}
Now, stand back...
{code}
gremlin> clock(1000){g.V().both().both().group().by('name').by(count())}
==>0.008825609
gremlin> clock(1000){g.V().both().both().groupCount().by('name')}
==>0.0051918749999999994
{code}
Speed differences are reasonable and I know various places in the new {{GroupStep}} that I can optimize to make more efficient.
And that is how the dishes get done.
> Remove GroupCountStep in favor of new Reduce-based GroupStep
> ------------------------------------------------------------
>
> Key: TINKERPOP3-872
> URL: https://issues.apache.org/jira/browse/TINKERPOP3-872
> Project: TinkerPop 3
> Issue Type: Improvement
> Components: process
> Affects Versions: 3.0.1-incubating
> Reporter: Marko A. Rodriguez
> Assignee: Marko A. Rodriguez
>
> Check it. In the {{group_step_2/}} branch, we can now do this efficiently as we now support "on the fly" reduction.
> {code}
> gremlin> g.V().both().both().group().by('name').by(count())
> ==>[ripple:3, peter:3, vadas:3, josh:7, lop:7, marko:7]
> gremlin> g.V().both().both().groupCount().by('name')
> ==>[ripple:3, peter:3, vadas:3, josh:7, lop:7, marko:7]
> {code}
> Now, stand back...
> {code}
> gremlin> clock(10000){g.V().both().both().groupCount().by('name').next()}
> ==>0.0415874797
> gremlin> clock(10000){g.V().both().both().group().by('name').by(count()).next()}
> ==>0.08681611759999999
> {code}
> Speed differences are reasonable and I know various places in the new {{GroupStep}} that I can optimize to make more efficient.
> And that is how the dishes get done.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)