[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-04-12 Thread Marko A. Rodriguez (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15237331#comment-15237331
 ] 

Marko A. Rodriguez commented on SOLR-8176:
--

I thought people on this ticket might like to learn more about how they could 
leverage Apache TinkerPop for this problem.

http://www.planettinkerpop.org/#gremlin
http://www.planettinkerpop.org/#vendors


> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
> Attachments: SOLR-8176.patch
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-03-23 Thread Joel Bernstein (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15208794#comment-15208794
 ] 

Joel Bernstein commented on SOLR-8176:
--

The data would be spread across an entire collection. The traversal would be 
done in a single worker node by performing iterative joins across the 
collection. The book keeping needed for the traversal would be written to files 
on the worker node. I looked at using multiple worker nodes to do the graph 
traversal and it may be possible but looks much trickier.

For small traversals this approach will be sub-second. For really large 
traversals this will take longer but should get to an answer.

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-03-23 Thread Jack Krupansky (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15208763#comment-15208763
 ] 

Jack Krupansky commented on SOLR-8176:
--

To what extent can the graph traversal be parallelized for the data on a single 
node? The eternal question with Solr is how much data you can put on a node 
before you need to shard, or how big each shard can be. I'm curious how graph 
traversal affects that calculation. Also, how merge policy and segment size 
should be configured so that segments can be traversed in parallel. If there 
was some more idea way to organize the nodes in segments, maybe people could 
pack a lot more data on fat nodes to reduce the inter-node delays. 
Alternatively, maybe have more nodes mean more of the operations can be done in 
parallel without conflicting on local machine resources. Interesting tradeoffs.

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-03-23 Thread Joel Bernstein (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15208699#comment-15208699
 ] 

Joel Bernstein commented on SOLR-8176:
--

In regards to the tinkerpop discussions on this ticket. I'm planning on first 
adding some Streaming Expressions that model some basic graph traversal use 
cases. This will iron out some of the mechanics involved in doing graph 
traversals. This will start to build the foundation for supporting the Gremlin 
query language. This was the same approach taken when the parallel relational 
algebra came first and became the foundation of the SQL interface. This 
approach achieves a number of things:

1) It doesn't put the cart before the horse. In order to properly support 
Gremlin we need a scalable distributed graph traversal capability. Once we have 
that adding Gremlin or SparkQL support will be much easier then trying to 
bootstrap graph capabilities while working on Gremlin at the same time.

2) We can then use Gremlin as a driver for building out the full range of graph 
traversal streaming expressions. The SQL interface plays this role for the 
parallel relational algebra Streaming Expressions. 

3)  Building out all Graph traversals as streaming expression means that we can 
than directly plug in the graph expressions with the existing expression 
library. 

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-03-23 Thread Joel Bernstein (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15208523#comment-15208523
 ] 

Joel Bernstein commented on SOLR-8176:
--

I've been thinking about starting to work on this as well, but with a slightly 
different approach then [~kwatters].

The approach I'm thinking of taking is fully distributed and doesn't rely on 
low level query operations. Instead it moves the Iterative joins into a single 
worker node that sees all the shards. That single worker node will issue 
iterative joins using a batch nested loop approach. Cycle detection will be 
implemented with a locally sorted list of visited nodes (on disk) that can be 
intersected with the nodes coming back from the nested loop joins. This 
approach will not be anywhere near as fast as the low level query work that 
Kevin has done, but it will be really scalable and eventually always get to the 
answer given enough time. So while the low level approach will be great for use 
cases like access control, the fully distributed approach will be great for use 
cases where the graph traversal is the main query and some allowances can be 
made in the time it takes to complete.

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-03-18 Thread Kevin Watters (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15197814#comment-15197814
 ] 

Kevin Watters commented on SOLR-8176:
-

Hi Gopal,
  I'm running a little bit behind the times,  I'm still working off a branch 
that was checked out from SVN.  I'll update to trunk from git and make sure my 
local tests are still passing and I'll post a patch after I can clean up my 
comments and code a little bit.

Joel, 
  Thanks for the pointer,  I'll have a look at the TopicStream...  It might do 
what we need.  If not, maybe we can extend it.  I've been focusing on Kafka 
because it's pretty simple, generic, robust and scales really well.  I'm not 
tied to any particular technology for it, so long as we can publish some 
objects with a unique topic identifier.



> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-03-14 Thread Gopal Patwa (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15194132#comment-15194132
 ] 

Gopal Patwa commented on SOLR-8176:
---

Kevin, I am also interested in your solution using GraphQuery with Kafka 

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-03-13 Thread Joel Bernstein (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15192404#comment-15192404
 ] 

Joel Bernstein commented on SOLR-8176:
--

Sounds like an interesting implementation. I'd be happy to review the patch. 
I'm very curious to see how the Kafka integration works. Solr now has it's own 
messaging capability called the TopicStream but I'm not sure if it will meet 
the needs in this case. But let's definitely pursue the work you've been doing. 

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-03-12 Thread Kevin Watters (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15192120#comment-15192120
 ] 

Kevin Watters commented on SOLR-8176:
-

Hey Guys,  I know you're really focusing on streaming expressions for graph 
traversal, I just wanted to throw it out there.  I have a version of it working 
based on the GraphQuery.  It's completely distributed, the only kicker is, I 
implemented it with a dependency on Kafka as a message broker to handle the 
shuffling of the frontier query.  I was curious if there's a message broker 
already in the Solr stack, if so, it should be reasonably easy to swap out the 
kafka dependency and then we'll all have a fully distributed graph traversal in 
Solr.  Let me know what you think, 

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: master
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: master
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-01-29 Thread Dennis Gove (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15124557#comment-15124557
 ] 

Dennis Gove commented on SOLR-8176:
---

I'm having trouble envisioning the expression for this.

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: Trunk
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: Trunk
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-01-29 Thread Marko A. Rodriguez (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15124208#comment-15124208
 ] 

Marko A. Rodriguez commented on SOLR-8176:
--

I work on Apache TinkerPop. [~ranma] sent our dev@ list a link to this ticket. 
He thought it might be good for us to tell you the advantages of TinkerPop.

* TinkerPop supports the property graph representation. There are vertices, 
edges, and vertices and edges can have key/value properties.
* There is a core API that any graph system provider must implement: {{Graph}}, 
{{Vertex}}, {{Edge}}, etc.
* If the graph system provider wants to support OLAP operations, then they need 
to implement {{GraphComputer}}.
* There is an extensive test suite that validates the implementation to ensure 
consistent semantics.
** Providers can deviate from the norm a bit here and there and they articulate 
their variations in their {{Features}} implementation.
* Once that is all said an done the providers implementation is deemed 
"TinkerPop-enabled."
** All TinkerPop-enabled graph systems "feel the same" to the end user. Think 
"JDBC for graphs."
* The Gremlin VM can execute over any TinkerPop-enabled graph system.
** The Gremlin VM is a distributed VM that supports both OLTP and OLAP 
operations.
*** http://arxiv.org/abs/1508.03843
** The same Gremlin query compiles down to either execution representation.
*** 
http://www.datastax.com/dev/blog/the-benefits-of-the-gremlin-graph-traversal-machine
** Gremlin's instruction set can be written out by any other compiler and thus, 
there exists:
*** SPARQL-Gremlin: https://github.com/dkuppitz/sparql-gremlin
*** SQL-Gremlin: https://github.com/twilmes/sql-gremlin
* The graph system provider can implement {{InputRDD}} or {{InputFormat}} 
interfaces to all {{SparkGraphComputer}} and {{GiraphGraphComputer}} to process 
their graph.
** http://tinkerpop.apache.org/docs/3.1.0-incubating/#sparkgraphcomputer
** http://tinkerpop.apache.org/docs/3.1.0-incubating/#giraphgraphcomputer

Thats the general gist of TinkerPop. It would be great to see SOLR support it. 
Take care.
 


> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: Trunk
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: Trunk
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2016-01-13 Thread Joel Bernstein (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15096707#comment-15096707
 ] 

Joel Bernstein commented on SOLR-8176:
--

Thinking some about the machanics of what you're describing.

One possible approach to this is to shuffle results from an initial query to 
worker nodes. Then the worker nodes persist the current working set locally. 
Then the next iteration starts from the worker nodes that persisted the working 
set. Each step in the traversal could be done like this. The effect would be 
that the graph traversal would *hop* from one set of workers to another set of 
workers with each iteration.

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: Trunk
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: Trunk
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2015-12-29 Thread Dennis Gove (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15073843#comment-15073843
 ] 

Dennis Gove commented on SOLR-8176:
---

I've been thinking about this a little bit and one thing I keep coming back to 
is that there are different kinds of graph traversals and I think our model 
should take that into account. There are lots of types but I think the two 
major categories are node traversing graphs and edge traversing graphs. 

h3. Node Traversing Graphs
These are graphs where you have some set of root nodes and you want to find 
connected nodes with some set of criteria. For example, given a collection of 
geographic locations (city, county, state, country) with fields "id", "type", 
"parentId", "name" find all cities in NY. As a hiccup the data is not 
completely normalized and some cities have their county listed as their parent 
while some have their state listed as their parent. Ie, you do not know how 
many nodes are between any given city and any given state.
{code}
graph(
  geography,
  root(q="type=state AND name:ny", fl="id"),
  leaf(q="type=city", fl="id,parentId,name"),
  edge("id=parentId")
)
{code}
In this example you're starting with a set of nodes in the geography 
collection, all which have some relationship to each other. You select your 
starting (root) nodes as all states named "ny" (there could be more than one). 
You then define what constitutes an ending (leaf) node as all cities. And 
finally, you say that all edges where nodeA.id == nodeB.parentId should be 
followed.

This traversal can be implemented as a relatively simple iterative search 
following the form
{code}
frontier := search for all root nodes
leaves := empty list

while frontier is not empty
  frontierIds := list of ids of all nodes in frontier list
  leaves :append: search for all nodes whose parentId is in frontierIds and 
matches the leaf filter
  frontier := search for all nodes whose parentId is in frontierIds and does 
not match the leaf filter

{code}
In each iteration the leaves list can grow and the frontier list is replaced 
with the next set of nodes to consider. In the end you have a list of all leaf 
nodes which in some way connect to the original root nodes following the 
defined edge. Note that for simplicity I've left a couple of things out, 
including checking for already traversed nodes to avoid loops. Also, the leaf 
nodes are not added to the frontier but they can be. This would be useful in a 
situation where leaves are connected to leaves.

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: Trunk
>Reporter: Joel Bernstein
>Assignee: Joel Bernstein
>  Labels: Graph
> Fix For: Trunk
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2015-11-13 Thread Joel Bernstein (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15004412#comment-15004412
 ] 

Joel Bernstein commented on SOLR-8176:
--

I need to dig into the TinkerPop API. I think implementing Gremlin would be the 
desired end game. 

I see distributed Gremlin implementation as another Parallel Computing problem, 
like the Parallel SQL interface. This is where the Streaming API comes in. If 
we model graph traversals with the Streaming API then we can have a Gremlin 
parser that compiles to Streaming API objects. This was the approach taken with 
the SQL interface.

So this ticket is really about laying the Parallel Computing framework for 
supporting graph traversals. 

Although I do agree that looking at TinkerPop will be very useful in 
understanding what to model.

> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: Trunk
>Reporter: Joel Bernstein
>Assignee: Joel Bernstein
>  Labels: Graph
> Fix For: Trunk
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org



[jira] [Commented] (SOLR-8176) Model distributed graph traversals with Streaming Expressions

2015-11-10 Thread Ran Magen (JIRA)

[ 
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14999203#comment-14999203
 ] 

Ran Magen commented on SOLR-8176:
-

Hey guys,
Have you thought of using [TinkerPop|http://tinkerpop.incubator.apache.org/] to 
help with graph traversals?
Implementing their API will enable graph queries with various query languages - 
Gremlin, SPARQL, and more in the future.



> Model distributed graph traversals with Streaming Expressions
> -
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
>  Issue Type: New Feature
>  Components: clients - java, SolrCloud, SolrJ
>Affects Versions: Trunk
>Reporter: Joel Bernstein
>  Labels: Graph
> Fix For: Trunk
>
>
> I think it would be useful to model a few *distributed graph traversal* use 
> cases with Solr's *Streaming Expression* language. This ticket will explore 
> different approaches with a goal of implementing two or three common graph 
> traversal use cases.



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

-
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org