vertices and edge. G=(V,E) ❖A graph DB is a system that helps us store, retrieve and consume data in a graph structured format ❖USP- Relationship Women Who Code Vertex 2 [properties] Vertex 1 [properties] Edge [properties]
Cities, Countries ➢ Organizations ❖ Relations ➢ Person -- founder---WWC ➢ Person -- BOD---WWC ➢ Person---Director---City ➢ Person--Member---City ➢ Person--Knows--Person Women Who Code
Founder A Yes B Yes C D E F G 1. In order to find the founders, must have a column with most rows empty 2. In order to map names to cities, perform costly join operations 3. RDBMS is useful for transactional data 4. How to map real time relations between person A and person B?
NOT provide schema management queries • Based on functional programming • Returns the result as an iterator • Default- Edges are directional • Support all primitive Java data types out of the box • +Many more!
Vendor agnostic ❖ Wrapper and driver support for many languages ❖ Intuitive Cons ❖ Just a DSL not a programming language ❖ No out of box support for schema and indexing ❖ Wrappers are slow
directors of WWC? Step 1: Go to the WWC org node Step 2 : Find out those people who are connected with the WWC org Step 3: Filter out those people who have an edge with label founder or BOD g.V().hasLabel(‘Org).has(‘name’,’WWC’).inE(‘founder_of’,bod_at’).outV().values(‘name’)
years old Step 1: Find all the people who are WWC directors Step2: Filter them by property age<30 g.V().hasLabel(‘Person’).outE(‘director_of’).inV().has(‘age’,lt(30)).values(‘name’)
media to members of same chapter 2. page Rank the most influential people in WWC network 3. Track growth of chapters 4. Personalize job recommendation 5. Mentor-Mentee opportunity Awesome WWC