diy graph search - max de marzi @ graphconnect boston + chicago 2013

Innovate. Share. Connect.Chicago June 12-13

DIY Graph SearchMax De Marzi, Neo Technology

Tuesday, June 18, 13

Can I Haz?Tuesday, June 18, 13

NopeTuesday, June 18, 13

#9,998,383,750,000


Can I make my own?


MaybeTuesday, June 18, 13

What do I know about

NLP?Tuesday, June 18, 13

NothingTuesday, June 18, 13

What do I know?


andTuesday, June 18, 13

CypherTuesday, June 18, 13

I can query a graph


How?Tuesday, June 18, 13

��

Matching PatternsTuesday, June 18, 13

ASCII Art


() --> ()

ASCII Art


Named Nodes


(A) --> (B)

Named Nodes


LOVES

Typed Relationships


A -[:LOVES]-> B

LOVES

Typed Relationships


Describing a Path


A --> B --> C

Describing a Path


A

B C

Multiple Paths


A --> B --> C, A --> C

A

B C

Multiple Paths


A --> B --> C, A --> C

A

B C

A --> B --> C <-- A

Multiple Paths


The START Clause


The START Clause

START me=node(1)RETURN me


with an Index


with an Index

START me=node:Users(name=‘Max’)RETURN me


The MATCH Clause


The MATCH Clause

START me=node:Users(name=‘Max’)MATCH me -[:friends]-> peopleRETURN people


My friends who like cheese



START me=node:Users(name=‘Max’) thing=node:Things(name=‘Cheese’)MATCH me -[:friends]-> people -[:like]-> thingRETURN people



START me=node:Users(name=‘Max’) thing=node:Things(name=‘Cheese’)MATCH me -[:friends]-> people, people -[:like]-> thingRETURN people


My friends who like ?


My friends who like ?START me=node({me}), thing=node:Things({thing})MATCH me -[:friends]-> people, people -[:like]-> thingRETURN people

Params :{“me”: 1, “thing”: “name: cheese”}


My friends who like ? and ?


My friends who like ? and ?

START me=node({me}), thing1=node:Things({thing1}), thing2=node:Things({thing2})MATCH me -[:friends]-> people, people -[:like]-> thing1, people -[:like]-> thing2RETURN peopleParams :{“me”: 1, “thing1”: “name: cheese”, “thing2”: “name: wine”}


People who like ? and ?


People who like ? and ?START thing1=node:Things({thing1}), thing2=node:Things({thing2})MATCH people -[:like]-> thing1, people -[:like]-> thing2RETURN peopleParams :{“thing1”: “name: cheese”, “thing2”: “name: wine”}


I need to build a Cypher Query


SEMR

✦ Gateway drug to NLP

✦ 4 years old

✦ Didn’t work on my Mac

✦ Pointed me to Treetop


Treetop✦ Create a Grammar by

making some Rules

✦ Turn expression into Syntax Tree

✦ Build custom Syntax Nodes

✦ Prune the tree

✦ to_cypher


Friends Rule


Friends Rule

rule friends “friends” <Friends>end


friends to_cypher


friends to_cypher class Friends < Treetop::Runtime::SyntaxNode

def to_cypher

return {:start => "me = node({me})",

:match => "me -[:friends]-> people",

:return => "people",

:params => {"me" => nil }}

end

end


Likes Rule


Likes Rule

rule likes "who like" <Likes>end


likes to_cypher


likes to_cypher class Likes < Treetop::Runtime::SyntaxNode

def to_cypher

return {:match => "people -[:likes]-> thing"}

end

end


Thing Rule


Thing Rule

rule thing [a-zA-Z0-9]+ <Thing>end


thing to_cypher


thing to_cypherclass Thing < Treetop::Runtime::SyntaxNode

def to_cypher

return {:start => "thing = node:things({thing})",

:params => {"thing" => "name: " + self.text_value } }

end

end


Show and Tellhttps://github.com/maxdemarzi/neo_graph_search

http://maxdemarzi.com/2013/01/28/facebook-graph-search-with-cypher-and-neo4j/


https://github.com/maxdemarzi/neo_graph_search

https://github.com/maxdemarzi/neo_graph_search





diy graph search - max de marzi @ graphconnect boston + chicago 2013

Technology

friends people

friends ruletuesday

match people

cypherclass friends

thing ruletuesday

cypherclass thing treetop

thing rulerule thingaza

thingreturn peopletuesday