Download as PDF, PPTX
![Relationships
➔ CREATE Relation
◆ Match (u:User {name:"James"}), (c:Company
{name:"Netsol"}) create (u)-[:EMP]-> (c)
◆ Match (u:User {id:1}), (u1:User {id:2})
create (u)-[:FRIEND {type:"Brothers"}]->
(u1) RETURN u, u1
➔ NOTE: By convention those relationship-types are written
all upper case using underscores between words.](https://image.slidesharecdn.com/graphdatabase-150614135012-lva1-app6892/75/Graph-Database-Using-Neo4J-22-2048.jpg)
![Relationships
➔ MATCH
◆ (node1)-[rel:TYPE]->(node2)
◆ MATCH(u:User) -[rel:FRIEND]-> (u1:User)
RETURN u.name, u1.name, rel.type
◆ MATCH(u:User) -[:FRIEND]-> (u1:User) -[:
FRIEND]-> (u2:User) RETURN u, u1, u2](https://image.slidesharecdn.com/graphdatabase-150614135012-lva1-app6892/75/Graph-Database-Using-Neo4J-23-2048.jpg)
![Relationships
➔ MATCH
◆ MATCH(u:User) -[*]-> (u1:User) RETURN u,
u1
◆ MATCH(u:User) -[*1..5]-> (u1:User) RETURN
u, u1
◆ MATCH(u:User) -[*2]-> (u1:User) RETURN u,
u1
◆ MATCH(u:User) -[:FRIEND*2]-> (u1:User)
RETURN u, u1](https://image.slidesharecdn.com/graphdatabase-150614135012-lva1-app6892/75/Graph-Database-Using-Neo4J-24-2048.jpg)
![Relationships
➔ CREATE Relation
◆ Match (u:User {name:"James"}), (c:Company
{name:"Netsol"}) create (u)-[:EMP]-> (c)
◆ Match (u:User {id:1}), (u1:User {id:2})
create (u)-[:FRIEND {type:"Brothers"}]->
(u1) RETURN u, u1
➔ NOTE: By convention those relationship-types are written
all upper case using underscores between words.](https://crownmelresort.com/image.slidesharecdn.com/graphdatabase-150614135012-lva1-app6892/75/Graph-Database-Using-Neo4J-22-2048.jpg)
![Relationships
➔ MATCH
◆ (node1)-[rel:TYPE]->(node2)
◆ MATCH(u:User) -[rel:FRIEND]-> (u1:User)
RETURN u.name, u1.name, rel.type
◆ MATCH(u:User) -[:FRIEND]-> (u1:User) -[:
FRIEND]-> (u2:User) RETURN u, u1, u2](https://crownmelresort.com/image.slidesharecdn.com/graphdatabase-150614135012-lva1-app6892/75/Graph-Database-Using-Neo4J-23-2048.jpg)
![Relationships
➔ MATCH
◆ MATCH(u:User) -[*]-> (u1:User) RETURN u,
u1
◆ MATCH(u:User) -[*1..5]-> (u1:User) RETURN
u, u1
◆ MATCH(u:User) -[*2]-> (u1:User) RETURN u,
u1
◆ MATCH(u:User) -[:FRIEND*2]-> (u1:User)
RETURN u, u1](https://crownmelresort.com/image.slidesharecdn.com/graphdatabase-150614135012-lva1-app6892/75/Graph-Database-Using-Neo4J-24-2048.jpg)
Uploaded byHarmeet Singh(Taara)
Graph Database Using Neo4J
The document discusses the use of graph databases, particularly focusing on Neo4j and its query language Cypher, highlighting the differences between graph databases and relational databases (RDBMS). It explains the structure of Neo4j, the advantages of using graph databases, and provides several examples of Cypher queries for data manipulation. Additionally, it mentions sample applications utilizing Spring Data Neo4j and notes topics that were not covered in detail.
Graph Database Using Neo4J
- 1. Graph Database Using Neo4J By HarmeetSingh(Taara) (Java EE Developer) Email: harmeetsingh.0013@gmail.com Website: http://programmers-nest.com Blog: http://harmeetsingh13.blogspot.com Skype: harmeetsingh0013
- 2. Contents ➔ Introduction ➔ BigData ➔ Graph Databases ➔ Graph DB Vs RDBMS ➔ Journey: RDBMS To Graph DB Modeling ➔ Neo4J ➔ Cypher Query ◆ CREATE, MATCH, WHERE, SET, DELETE, RETURN, REMOVE ◆ Relationship ◆ ORDER BY, SKIP, LIMIT, DISTINCT ◆ Aggregation ➔ Spring-Data-Neo4J Sample ➔ Leftover: The things we didn't cover
- 3. Acknowledgement ➔ Thanks ToMy Parents. ➔ Thanks To All Who Support Me or Not. ➔ Dedicated To My Teacher “Mr. Kapil Sakhuja”.
- 4. Introduction ➔ Today, wediscuss about Graph Database and Why Graph Databases involved. ➔ How we use Graph Database using Neo4J. ➔ Cypher Query Language for Neo4J. ➔ Spring-Data-Neo4J Sample Application.
- 5.
- 6. Graph Database ➔ AGraph Database is a set of vertices and edges. ➔ Graph Databases is to view the data as an arbitrary set of objects connected by one or more kinds of relationships.
- 7. Graph DB VsRDBMS ➔ RDBMS limitation on How a relationship is defined within a relational database? ➔ In RDBMS creating a join table that brings together two disparate tables is a common practice, doing so adds a layer of complexity.
- 8. Graph DB VsRDBMS ➔ A join table is created in order to have metadata that provides properties about relationships between two tables. When a similar relationship needs to be created among other tables, yet another join table must be created. ➔ Graph databases over relational database is to avoid what might be referred to as “join hell”
- 9. Journey: RDBMS toGraph DB Modeling ➔ In RDBMS, the data is collected in form of Tables, and the Tables are define with Rows And Columns. ➔ The single table contains Multiple Records and these records are represent to real world Entity.
- 10. Journey: RDBMS toGraph DB Modeling ➔ Now, in Graph Database the data represent in the form of Nodes and One node is compared to one record in table. ➔ The Node type is compared to Entity. ➔ In Graph DB, we can create easy relationships with nodes.
- 11. Neo4J Necessity Is TheMother Of Invention ➔ Neo4j began its life in 2000, when Emil Eifrem, Johan Svensson, and Peter Naubauer. ➔ World’s Best And First Graph Database.
- 12. Neo4J ➔ The “j”in Neo4j stands for Java, and the Java Development Kit (JDK) is required to run it. ➔ Neo aimed to introduce a database that offered a better way to model, store, and retrieve data while keeping all of the core concepts—such as ACIDity, transactions, and so forth—that made relational databases into a proven commodity.
- 13. Cypher Query Language ➔Cypher is the Declarative Query Language used for data manipulation in Neo4j. ➔ A Declarative Language is a high-level type of language in which the purpose is to instruct the application on what needs to be done or what you want from the application, as opposed to how to do it. ➔ Cypher is a Case Sensitive Language.
- 14. Cypher Query Language ➔Cypher is a declarative, SQL-inspired language for describing patterns in graphs. It allows us to describe what we want to select, insert, update or delete from a Graph Database without requiring us to describe exactly how to do it. ➔ Cypher is not yet a standard graph database language that can interact with other graph database platforms.
- 15. CREATE ➔ SQL ◆ INSERTINTO User (name, age) values (“James”, 26) ➔ Cypher ◆ CREATE (u:User {name:"James",age:"26"}) RETURN u
- 16. MATCH ➔ SQL ◆ SELECT* FROM User ◆ SELECT u.name FROM USER u ➔ Cypher ◆ MATCH (u:User) RETURN u ◆ MATCH (u:User) RETURN u.name
- 17. WHERE ➔ SQL ◆ SELECT* FROM User u WHERE u.age = 26 ➔ Cypher ◆ MATCH (u:User {age:26}) RETURN u ◆ MATCH (u:User) WHERE u.age = 26 RETURN u
- 18. SET ➔ SQL ◆ UPDATEUser u SET u.age = 26 WHERE u.name = “James” ◆ ALTER TABLE User ADD address varchar(45) ➔ Cypher ◆ MATCH (u:User {name:"James"}) SET u.age = 26 RETURN u ◆ MATCH (u:User {name:"James"}) SET u. address = "Moga" RETURN u
- 19. DELETE ➔ SQL ◆ DELETEFROM User u WHERE u.name IS NULL ➔ Cypher ◆ MATCH(u:User) WHERE u.name IS NULL DELETE u ➔ NOTE: If you delete a node that has relationships, you need to be sure to remove the relationships as well
- 20. RETURN ➔ The RETURNis similar to the SELECT statement found in SQL ➔ SQL ◆ SELECT u.name AS UserName, u.age AS Age FROM User u ➔ Cypher ◆ MATCH(u:User) RETURN u.name AS UserName, u.age AS Age
- 21. REMOVE ➔ SQL ◆ ALTERTABLE User u DROP COLUMN u.address WHERE u.name = “James” ➔ Cypher ◆ MATCH(u:User {name:"James"}) REMOVE u. address RETURN u
- 22. Relationships ➔ CREATE Relation ◆Match (u:User {name:"James"}), (c:Company {name:"Netsol"}) create (u)-[:EMP]-> (c) ◆ Match (u:User {id:1}), (u1:User {id:2}) create (u)-[:FRIEND {type:"Brothers"}]-> (u1) RETURN u, u1 ➔ NOTE: By convention those relationship-types are written all upper case using underscores between words.
- 23. Relationships ➔ MATCH ◆ (node1)-[rel:TYPE]->(node2) ◆MATCH(u:User) -[rel:FRIEND]-> (u1:User) RETURN u.name, u1.name, rel.type ◆ MATCH(u:User) -[:FRIEND]-> (u1:User) -[: FRIEND]-> (u2:User) RETURN u, u1, u2
- 24. Relationships ➔ MATCH ◆ MATCH(u:User)-[*]-> (u1:User) RETURN u, u1 ◆ MATCH(u:User) -[*1..5]-> (u1:User) RETURN u, u1 ◆ MATCH(u:User) -[*2]-> (u1:User) RETURN u, u1 ◆ MATCH(u:User) -[:FRIEND*2]-> (u1:User) RETURN u, u1
- 25. DISTINCT, ORDER BY,SKIP, LIMIT ➔ SQL ◆ SELECT DISTINCT u.name FROM User u WHERE u.age = 25 ORDER BY u.name DESC OFFSET 0 LIMIT 5 ➔ Cypher ◆ MATCH(u:User {age:25}) RETURN DISTINCT u.name ORDER BY u.name DESC SKIP 0 LIMIT 5
- 26. Aggregation ➔ COUNT ◆ MATCH(u:User{age:25}) RETURN COUNT(u. name) ➔ COLLECT ◆ MATCH(u:User {age:25}) RETURN COLLECT(u. name) ➔ NOTE: There are more aggregation functions like min(), max(), avg() etc.
- 27. Spring-Data-Neo4j Sample ➔ Pleaseaccess below link for Spring-Data-Neo4j Sample Application. ◆ https://github.com/harmeetsingh0013/Spring-Data- Neo4j-Example
- 28. Leftover: The thingswe didn’t cover ➔ Graph Theory ➔ Database ACID Operations ➔ Graph DB Modeling ➔ Advance Cypher Query Language ➔ Neo4j Aggregation Functions ➔ Neo4J Native Libraries With Java ➔ Neo4J Rest API ➔ Indexing
- 29. References ➔ Practical Neo4JBy Gregory Jordan Foreword By Jim Webber ➔ http://neo4j.com/top-ten-reasons/ ➔ http://neo4j.com/developer/get-started/