[ https://issues.apache.org/jira/browse/TINKERPOP-1585?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15795157#comment-15795157 ]
Marko A. Rodriguez commented on TINKERPOP-1585: ----------------------------------------------- Reviewing the {{DedupGlobalStep}} step code, I'm realizing that it is widely inefficient for "unbulkable traversers." For examples, when PATH/LABELED_PATH data is used. This doesn't explain the runtimes [~dkuppitz] is seeing, but will solve another problem. > OLAP dedup over non elements > ---------------------------- > > Key: TINKERPOP-1585 > URL: https://issues.apache.org/jira/browse/TINKERPOP-1585 > Project: TinkerPop > Issue Type: Bug > Components: hadoop, process > Affects Versions: 3.2.3 > Reporter: Daniel Kuppitz > Assignee: Marko A. Rodriguez > > OLAP {{dedup()}} is highly inefficient when it's fed with non elements. > In a customer project a query similar tho the following returned a result in > slightly more than 6 seconds: > {noformat} > persistedRDD. > V().hasLabel("label1","label2"). > inE("edgeLabel1","edgeLabel2").outV(). > id().count() > {noformat} > The same query with {{dedup()}} added: > {noformat} > persistedRDD. > V().hasLabel("label1","label2"). > inE("edgeLabel1","edgeLabel2").outV(). > id().dedup().count() > {noformat} > ...took more than 120 seconds. -- This message was sent by Atlassian JIRA (v6.3.4#6332)