[ 
https://issues.apache.org/jira/browse/TINKERPOP3-991?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
 ]

Ashish Nagavaram updated TINKERPOP3-991:
----------------------------------------
    Description: 
The current traverser is serial in nature, where some of the steps can be 
parallelized for latency critical cases. 

Eg:
Consider a movies graph where evert actor has a edge to the movie he has acted 
in.

Query:
movies by X and Y

The current way to do it would be to get movies by X and for each movie check 
if it has a edge to Y which is slow. I by passed this by getting movies by X 
and movies by Y in parallel and then do a intersection. But I would have do 
manually do this for every new pattern. 


Please close this ticket if you think this proposal does not make sense


  was:
The current traverser is serial in nature, where some of the steps can be 
parallelized for latency critical cases. 

Eg:
Consider a movies graph where evert actor has a edge to the movie he has acted 
in.

Query:
movies by X and Y

The current way to do it would be to get movies by X and for each movie check 
if it has a edge to Y which is slow. I by passed this by getting movies by X 
and movies by Y in parallel and then do a intersection. But I would have do 
manually do this for every new pattern. 


Please close this ticket if you think this proposal does not make sense ~smile~


> [Proposal] Capability to traverse OLTP in parallel
> --------------------------------------------------
>
>                 Key: TINKERPOP3-991
>                 URL: https://issues.apache.org/jira/browse/TINKERPOP3-991
>             Project: TinkerPop 3
>          Issue Type: New Feature
>          Components: process
>            Reporter: Ashish Nagavaram
>            Priority: Minor
>
> The current traverser is serial in nature, where some of the steps can be 
> parallelized for latency critical cases. 
> Eg:
> Consider a movies graph where evert actor has a edge to the movie he has 
> acted in.
> Query:
> movies by X and Y
> The current way to do it would be to get movies by X and for each movie check 
> if it has a edge to Y which is slow. I by passed this by getting movies by X 
> and movies by Y in parallel and then do a intersection. But I would have do 
> manually do this for every new pattern. 
> Please close this ticket if you think this proposal does not make sense



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

Reply via email to