SlideShare une entreprise Scribd logo
1  sur  78
Switching from the
                          Relational to the
                            Graph model
Luca Garulli –
Founder and CEO @NuvolaBase Ltd
Author of OrientDB Doc/Graph DB
                                                                    Nov 29th 2012 in Riga, Latvia
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License     Page 1
                                                                                                 www.orientechnologies.com
Agenda
                                                   12:30


  “Switching from the Relational to the Graph model”


                                              13:30
                                           Lunch time!


(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 2
Agenda
                                                   12:30                          You’re here!

  “Switching from the Relational to the Graph model”


                                              13:30
                                           Lunch time!


(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 3
One of the main resistances of
RDBMS users to pass to a NoSQL product
          are related to the
      complexity of the model:

            Ok, NoSQL products are super for
                  BigData and BigScale
                         but...
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 4
...what about the model?



(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 5
What is the NoSQL answer
         about managing complex domains?


                      Key-Value stores ?
                        Column-Based ?
                     Document database ?
                       Graph database !
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 6
CAUTION!
               This presentation will not use a
                   social like domain with
                   the classic paradigm of
                       friend-of-friendN
                 where the graph databases
                 are already widely used...
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 7
...But rather we will explore how
   to think «graphically» with one of the
        most common domains in the
              enterprise world:

                   The old-classic CRM* domain

                    * today in 99% of the cases a RDBMS is used


(c) Luca Garulli      Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 8
Every developer knows
 the Relational Model,
  but who knows the
      Graph one?
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 9
Back to school:
       Graph Theory crash course




(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 10
Basic Graph

                                                                              JavaDay
                                                                              JavaDay
                                         Likes                                  2012
                                                                                2012
                   Luca
                   Luca
                                                                                Riga
                                                                                 Riga
                                                                             Conference
                                                                             Conference




(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 11
Property Graph Model*
                                         Vertices are
                                          directed
                                                                            JavaDay 2012
                                                                            JavaDay 2012
               Luca
               Luca                                                             Riga
                                           Likes                                 Riga
            name: Luca
             name: Luca
          surname: Garulli
           surname: Garulli                since: 2012                       Conference
                                                                              Conference
       company: NuvolaBase
        company: NuvolaBase
                                                                                  date: Nov 29 2012
                                                                                   date: Nov 29 2012



 Vertices and Edges
 can have properties

                               * https://github.com/tinkerpop/blueprints/wiki/Property-Graph-Model
(c) Luca Garulli       Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License     Page 12
Property Graph Model
                                        Likes
                                         since:
                                                2012                          JavaDay
                                                                              JavaDay
                                                                                2012
                                                                                2012
                   Luca
                   Luca
                                      Speak                                     Riga
                                                                                 Riga
                                            s                                Conference
                                ti
                          abstra tle: «Switch
                                                                             Conference
                                ct: «Th       in
                                       is talk g...»
                                              presen
                                                     ts...»
       An Edge connects 2
  vertices: use multiple edges
   to represents 1-N and N-M
          relationships
(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 13
Property Graph Model
                                  Studies                                             Oxford
                                                                                      Oxford
 Luca
 Luca
                      Likes                                                                         located

            FriendOf
                                                                                           JavaDay 2012
                                                                                           JavaDay 2012
                                                                                               Riga
                                                                                                Riga
               John
               John                   Organizes                                             Conference
                                                                                             Conference

(c) Luca Garulli      Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License    Page 14
Compliments, this is your diploma in
        «Graph Theory»




(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 15
Now go back
       to our domain:
          the CRM
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 16
Domain: the super minimal CRM

                     Customer
                     Customer                             Address
                                                          Address




Registry system
Order system


                      Order
                      Order                                      Stock
                                                                 Stock



  (c) Luca Garulli            Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 17
Domain: the super minimal CRM

                     Customer
                     Customer                             Address
                                                          Address




                                                                                   How does
                                                                                Relational DBMS
Registry system
                                                                              manage relationships?
Order system


                      Order
                      Order                                      Stock
                                                                 Stock



  (c) Luca Garulli            Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 18
Relational World: 1-1 Relationships
Primary key                                                         Primary key
                     Customer                                                               Address
         Id         Name          Address                                   Id                  Location
                                                   Foreign key
         10 Luca                34                                          34     Rome
         11 Mike                44                                          44     London
         34 John                54                                          54     Oxford
         56 Mark                66                                          66     New Mexico
         88 Steve               68                                          68     Palo Alto


                   JOIN Customer.Address -> Address.Id


(c) Luca Garulli        Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License        Page 19
Relational World: 1-N Relationships
                   Customer                                                                  Address
         Id           Name                                              Id      Customer                    Location
         10 Luca                                                       24             10          Rome
         11 Mike                                                       33             10          London
         34 John                                                       44             34          Oxford
         56 Mark                                                       66             56          Cologne
         88 Steve                                                      68             88          Palo Alto


    Inverse JOIN Address.Customer -> Customer.Id


(c) Luca Garulli              Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License        Page 20
Relational World: N-M Relationships
             Customer                             CustomerAddress                                        Address
          Id        Name                           Id           Address                            Id      Location
          10       Luca                            10      24                                      24     Rome
          11       Mike                            10      33                                      33     London
          34       John                            11      44                                      44     Oxford
          56       Mark                                                                            66     Cologne
          88       Steve                                                                           68     Palo Alto


                             Additional table with 2 JOINs
                      (1) CustomerAddress.Id -> Customer.Id and
                      (2) CustomerAddress.Address -> Address.Id
(c) Luca Garulli           Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License       Page 21
Relational World: N-M Relationships
             Customer                             CustomerAddress                                        Address
          Id        Name                           Id           Address                            Id      Location
          10       Luca                            10      24                                      24     Rome
          11       Mike                            10      33                                      33     London
          34       John                            11      44                                      44     Oxford
          56       Mark                                                                            66     Cologne
          88       Steve                                                                           68     Palo Alto


                             Additional table with 2 JOINs
                      (1) CustomerAddress.Id -> Customer.Id and
                      (2) CustomerAddress.Address -> Address.Id
(c) Luca Garulli           Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License       Page 22
What’s wrong with the
                     Relational Model?


(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 23
The JOIN is the evil!
             Customer                             CustomerAddress                                        Address
          Id        Name                           Id           Address                            Id      Location
          10       Luca                            10      24                                      24     Rome
          11       Mike                            10      33                                      33     London
          34       John                            34      24                                      44     Oxford
          56       Mark                                                                            66     Cologne
          88       Steve                                                                           68     Palo Alto


                           These are all JOINs executed
                             everytime you traverse a
                                   relationship!
                                    relationship
(c) Luca Garulli           Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License       Page 24
A JOIN means searching for a key in
                  another table

   The first rule to improve performance
           is indexing all the keys

Index speeds up searches, but slows down
       insert, updates and deletes
 (c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 25
So in the best case a JOIN is a lookup
                into an index

                   This is done per single join!

If you traverse hundreds of relationships
    you’re executing hundreds of JOINs

(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 26
Index Lookup
            is it really that fast?

(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 27
Index Lookup: how does it works?
                                                        A-Z

                                                  A-L         M-Z




                Think to an
               Address Book
           where we have to find
             the Luca’s phone
                  number


(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 28
Index Lookup: how does it works?
                                                        A-Z

                                                  A-L         M-Z


                              A-L                                              M-Z

                        A-D         E-L                                  M-R         S-Z



                                                          Index algorithms are all
                                                           similar and based on
                                                              balanced trees



(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 29
Index Lookup: how does it works?
                                                                           A-Z

                                                                     A-L         M-Z


                                           A-L                                               M-Z

                                     A-D         E-L                                   M-R         S-Z


                         A-D                                 E-L

                   A-B         C-D                     E-G         H-L




(c) Luca Garulli               Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 30
Index Lookup: how does it works?
                                                                           A-Z

                                                                     A-L         M-Z


                                           A-L                                                   M-Z

                                     A-D         E-L                                       M-R         S-Z


                         A-D                                 E-L

                   A-B         C-D                     E-G         H-L


                                           E-G                                 H-L

                                     E-F         G                       H-J         K-L




(c) Luca Garulli               Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 31
Index Lookup: how does it works?
                                                                           A-Z

                                                                     A-L         M-Z


                                           A-L                                               M-Z
                                                                                                    Found!
                                     A-D         E-L                                       M-R  S-Z
                                                                                              This lookup took 5
                         A-D                                 E-L                               steps and grows
                   A-B         C-D                     E-G         H-L
                                                                                               up with the index
                                           E-G                                 H-L                   size!
                                     E-F         G                       H-J         K-L


                                                                                  Luca


(c) Luca Garulli               Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 32
An index lookup is executed
                          for each JOIN

  Querying more tables can easily
produce millions of JOINs/Lookups!

      Here the rule: more entries
   = more lookup steps = slower JOIN
(c) Luca Garulli      Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 33
Oh! This is why
 performance of my database
       drops down when
      it becomes bigger,
          and bigger,
          and bigger!
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 34
Is there a better way to
               manage relationships?


(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 35
“A graph database is any
                storage system
                 that provides
            index-free adjacency”
                                                                    - Marko Rodriguez

(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 36
How does GraphDB manage
      index-free relationships?


(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 37
an Open Source (Apache licensed)
            document-graph NoSQL dbms
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 38
Ø config
          download, unzip, run!
       cut & paste the db directory
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 39
150,000        records per second
                   (flat records, no index, on commodity hw)



(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 40
Schema-less
 schema is not mandatory, relaxed model,
collect heterogeneous documents all together


(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 41
Schema-full
schema with        constraints on fields and validation rules

                    Customer.age > 17
                 Customer.address not null
             Customer.surname is mandatory
  Customer.email matches 'b[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,4}b'


(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 42
Schema-mixed
schema with mandatory and optional fields + constraints
    the best of schema-less and schema-full modes



(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 43
ACID Transactions
           db.begin();
           try{
             // your code
             ...
             db.commit();

           } catch( Exception e ) {
             db.rollback();
           }


(c) Luca Garulli      Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 44
Complex types
native support for            collections, maps (key/value)
                         and embedded documents
                    no more additional tables to handle them


 (c) Luca Garulli        Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 45
SQL
select * from employee where name like '%Jay%' and status=0



(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 46
runs
                    Java
                   everywhere is available JRE1.6+
                                                                                       ®
                        robust engine
(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 47
Language bindings
                              Java as native

               JRuby, PHP, C, C++, Scala, .NET,
                    Ruby, Clojure, Node.js,
                 Python, Javascript and more!

(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 48
JPA (partial)
                      public class Customer {
                        @Id
                        private Object id;

                             private String name;
                             private String surname;
                      }

                      db.save( new Customer() );
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 49
Born for the Internet
     Supports natively HTTP/RESTful protocol
        Documents are transferred in JSON



(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 50
MVRB-Tree                                                             index

         the best of B+Tree and RB-Tree
       fast on browsing, low insertion cost
               it's a new algorithm!

(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 51
Security
    users and roles, encrypted passwords
             fine grain privileges
       (similar to what RDBMSs offer)

(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 52
Cache
                   You can avoid using 3°party caches
                            like Memcached

                            2 Levels of cache:
                   Level1: Database level, 1 per thread
                     Level2: Storage level, 1 per JVM
(c) Luca Garulli       Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 53
Inheritance
                   OGraphVertex (V)




                   Person             Vehicle
              Address : Address      brand : BRANDS




  Customer               Provider
   totSold : float      totBuyed : float



(c) Luca Garulli            Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 54
Polymorphic SQL Query
                   OGraphVertex (V)




                   Person             Vehicle
              Address : Address      brand : BRANDS
                                                             select * from Person
                                                              where city.name = 'Rome‘

                                                                      Queries are polymorphics
  Customer               Provider                                  and subclasses of Person can be
   totSold : float      totBuyed : float                                  part of result set

(c) Luca Garulli            Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 55
Let’s go back
                   to the Graph Stuff

             How does OrientDB
            manage relationships?
(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 56
OrientDB: traverse a relationship
                                             The Record ID (RID)
                                           is the physical position



                   RID = #13:35
                   RID = #13:35                                                               RID = #13:100
                                                                                              RID = #13:100




                     Luca
                     Luca                                                                       Rome
                                                                                                Rome

           label : :‘Customer’
            label ‘Customer’                                                               label = ‘Address’
                                                                                            label = ‘Address’
           name : :‘Luca’
            name ‘Luca’                                                                    name = ‘Rome’
                                                                                            name = ‘Rome’



(c) Luca Garulli           Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License     Page 57
OrientDB: traverse a relationship
                                          The Edge’s RID is saved
                                          inside both vertices, as
                                               «out» and «in»

                   RID = #13:35
                   RID = #13:35                                                               RID = #13:100
                                                                                              RID = #13:100
                                                    RID = #14:54
                                                    RID = #14:54


                                                       Lives
                     Luca
                     Luca                                                                       Rome
                                                                                                Rome
                                                out: [#13:35]
                                                 out: [#13:35]
                                                in: [#13:100]
                                                 in: [#13:100]
           out ::[#14:54]                       Label : :‘Lives’
                                                 Label ‘Lives’                             in: [#14:54]
            out [#14:54]                                                                    in: [#14:54]
           label : :‘Customer’
            label ‘Customer’                                                               label = ‘Address’
                                                                                            label = ‘Address’
           name : :‘Luca’
            name ‘Luca’                                                                    name = ‘Rome’
                                                                                            name = ‘Rome’


(c) Luca Garulli           Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License     Page 58
OrientDB: traverse a relationship



                   RID = #13:35
                   RID = #13:35                                                               RID = #13:100
                                                                                              RID = #13:100
                                                    RID = #14:54
                                                    RID = #14:54


                                                       Lives
                     Luca
                     Luca                                                                       Rome
                                                                                                Rome
                                                out: [#13:35]
                                                 out: [#13:35]
                                                in: [#13:100]
                                                 in: [#13:100]
           out ::[#14:54]                       Label : :‘Lives’
                                                 Label ‘Lives’                             in: [#14:54]
            out [#14:54]                                                                    in: [#14:54]
           label : :‘Customer’
            label ‘Customer’                                                               label = ‘Address’
                                                                                            label = ‘Address’
           name : :‘Luca’
            name ‘Luca’                                                                    name = ‘Rome’
                                                                                            name = ‘Rome’


(c) Luca Garulli           Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License     Page 59
OrientDB: traverse a relationship



                   RID = #13:35
                   RID = #13:35                                                               RID = #13:100
                                                                                              RID = #13:100
                                                    RID = #14:54
                                                    RID = #14:54


                                                       Lives
                     Luca
                     Luca                                                                       Rome
                                                                                                Rome
                                                out: [#13:35]
                                                 out: [#13:35]
                                                in: [#13:100]
                                                 in: [#13:100]
           out ::[#14:54]                       Label : :‘Lives’
                                                 Label ‘Lives’                             in: [#14:54]
            out [#14:54]                                                                    in: [#14:54]
           label : :‘Customer’
            label ‘Customer’                                                               label = ‘Address’
                                                                                            label = ‘Address’
           name : :‘Luca’
            name ‘Luca’                                                                    name = ‘Rome’
                                                                                            name = ‘Rome’


(c) Luca Garulli           Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License     Page 60
GraphDB handles relationships as a
                       physical LINK to the record
                   assigned when the edge is created

                                     on the other side

                   RDBMS computes the
      relationship every time you query a database

                             Is not that crazy?!
(c) Luca Garulli      Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 61
This means jumping from a
                   O(log N) algorithm to a near O(1)

              traversing cost is not more affected
                       by database size!

                    This is huge in the BigData age

(c) Luca Garulli       Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 62
OrientDB in the Blueprints micro-benchmark,
           on common hw, with a hot cache,
                       traverses 29,6 Millions
             of records in less than 5 seconds

   about 6 Millions of nodes traversed per sec!
                   Do not try this at home
                       with a RDBMS*!


                                          *unless you live in the Google’s server farm
(c) Luca Garulli       Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 63
Create the graph in SQL
$luca> cd bin
$luca> ./console.sh
OrientDB console v.1.3.0-SNAPSHOT (www.orientdb.org)
Type 'help' to display all the commands supported.

orientdb> create vertex Customer set name = ‘Luca’
Created vertex #13:35 in 0.03 secs

orientdb> create vertex Address set name = ‘Rome’
Created vertex #13:100 in 0.02 secs

orientdb> create edge Lives from #13:35 to #13:100
Created edge #14:54 in 0.02 secs
(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 64
Create the graph in Java
OGraphDatabase graph = new OGraphDatabase("local:/tmp/db/graph”);

ODocument luca = graph.createVertex(“Customer");
luca.field(“name", “Luca");

ODocument rome = graph.createVertex(“Address”);
rome.field(“name", “Rome”);

ODocument edge = graph.createEdge(luca, rome, “Lives”);
edge.save();

graph.close();

(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 65
Query the graph in SQL

orientdb> select in.out from Address where name = ‘Rome’
---+------+---------|--------------------+--------------------+--------+
  #| RID |@class    |label               |out                 |in      |
---+------+---------+--------------------+--------------------+--------+
  0| 13:35|Customer |Luca                |[#14:54]            |        |
---+------+---------+--------------------+--------------------+--------+
1 item(s) found. Query executed in 0.007 sec(s).




                                                                                Incoming vertices


(c) Luca Garulli     Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 66
More on query power
orientdb> select sum( out.in[@class=‘Order’].total ) from Customer
                 where name = ‘Luca’


orientdb> traverse Customer.out, Friend.in from Customer
                               while $depth <= 7


orientdb> select from (
            traverse Customer.out, Friend.in from Customer
                               while $depth <= 7
           ) where @class=‘Customer’ and city.name = ‘Riga’

(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 67
Query vs traversal

Once you’ve a well connected database
 in the form of a Super Graph you can
 cross records instead of query them!

           All you need is some root vertices
                where to start traversing
(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 68
Query vs traversal
    Special
     Special
                                                  Customers
                                                  Customers                                         Stocks
                                                                                                    Stocks
   Customers
   Customers




                   Luca
                   Luca                  John
                                         John                     Sylvia
                                                                  Sylvia
                                                                                                   White
                                                                                                   White
  This is a                                                                                        Soap
                                                                                                   Soap
root vertex                                          Order
                                                     Order                     Order
                                                                               Order
                                                     2332
                                                     2332                      8834
                                                                               8834

(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 69
This is your database




(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 70
Get last customer bought Whisky
  select last(out.in[@class=‘Order’].out.in[@class=‘Customer’]) from Stock
     where name = ‘Whisky’




(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 71
Get it’s country



                                                  select out.in[@class=‘city’] from #34:22
                   Riga, Latvia




(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 72
Get orders from that country




     select in.out[@class=‘Customer’] from #55:12



(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 73
NuvolaBase.com

                                                                                  HTTP/REST
                   HTTP/REST




   The first Graph Database as a Service
                on the Cloud
(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 74
Do we have enough time for live demo?




(c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 75
Questions & (maybe) Answers
                                    Luca Garulli
                                                                          CEO at

           Document-Graph NoSQL
             Open Source project
                                                                                      Ltd, London UK

                   www.twitter.com/lgarulli
                                                                             Conclusion as last ->
(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 76
Summary
           1)JOIN is heavy, specially on large databases

                       2)GraphDB uses LINK as
                      direct pointers to records:
                   times from O(log)N to near O(1)
                        = ready for the BigData

      3) GraphDB has a query language specialized to
                  traverse relationships
(c) Luca Garulli    Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 77
Let’s move like a
     Spider
   on the web




 (c) Luca Garulli   Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License   Page 78

Contenu connexe

En vedette

Mecanismos de protección de archivos
Mecanismos de protección de archivosMecanismos de protección de archivos
Mecanismos de protección de archivosOscar LS
 
JUIZ SERGIO MORO RECEBE AÇÃO CONTRA LULA
JUIZ SERGIO  MORO   RECEBE AÇÃO  CONTRA  LULAJUIZ SERGIO  MORO   RECEBE AÇÃO  CONTRA  LULA
JUIZ SERGIO MORO RECEBE AÇÃO CONTRA LULAClaudio Oliveira
 
Trabalho 1 TESTE
Trabalho 1 TESTETrabalho 1 TESTE
Trabalho 1 TESTEmlcunha
 
Análise dos Dados E.E.M. Macário Borba
Análise dos Dados E.E.M. Macário BorbaAnálise dos Dados E.E.M. Macário Borba
Análise dos Dados E.E.M. Macário Borbajana_ramos
 
Romanico
RomanicoRomanico
Romanicoaialo1
 
Risaale Razawiah 2
Risaale Razawiah 2Risaale Razawiah 2
Risaale Razawiah 2Wajid Malik
 
Concert CAMM Quintet programa de mà
Concert CAMM Quintet programa de màConcert CAMM Quintet programa de mà
Concert CAMM Quintet programa de màBarbara Sales Alos
 
Zpráva PwC Česká republika o trvale udržitelném podnikání a firemní odpovědno...
Zpráva PwC Česká republika o trvale udržitelném podnikání a firemní odpovědno...Zpráva PwC Česká republika o trvale udržitelném podnikání a firemní odpovědno...
Zpráva PwC Česká republika o trvale udržitelném podnikání a firemní odpovědno...PwC Česká republika
 
Introduction to Python for Data Science
Introduction to Python for Data ScienceIntroduction to Python for Data Science
Introduction to Python for Data ScienceVassilios Rendoumis
 
Python for Data Science - Python Brasil 11 (2015)
Python for Data Science - Python Brasil 11 (2015)Python for Data Science - Python Brasil 11 (2015)
Python for Data Science - Python Brasil 11 (2015)Gabriel Moreira
 
Lux, dove & lifebuoy. marketing mix
Lux, dove & lifebuoy. marketing mixLux, dove & lifebuoy. marketing mix
Lux, dove & lifebuoy. marketing mixSumant Rathod
 
Sociedade e vida cotidiana na américa portuguesa
Sociedade e vida cotidiana na américa portuguesaSociedade e vida cotidiana na américa portuguesa
Sociedade e vida cotidiana na américa portuguesaEdenilson Morais
 
A case study on lifebuoy
A case study on lifebuoyA case study on lifebuoy
A case study on lifebuoyGeorge Cherian
 

En vedette (16)

Mecanismos de protección de archivos
Mecanismos de protección de archivosMecanismos de protección de archivos
Mecanismos de protección de archivos
 
PEDIDO DE PRISÃO DE LULA
PEDIDO  DE PRISÃO  DE  LULAPEDIDO  DE PRISÃO  DE  LULA
PEDIDO DE PRISÃO DE LULA
 
Curso de contexto.
Curso de contexto.Curso de contexto.
Curso de contexto.
 
JUIZ SERGIO MORO RECEBE AÇÃO CONTRA LULA
JUIZ SERGIO  MORO   RECEBE AÇÃO  CONTRA  LULAJUIZ SERGIO  MORO   RECEBE AÇÃO  CONTRA  LULA
JUIZ SERGIO MORO RECEBE AÇÃO CONTRA LULA
 
Trabalho 1 TESTE
Trabalho 1 TESTETrabalho 1 TESTE
Trabalho 1 TESTE
 
Análise dos Dados E.E.M. Macário Borba
Análise dos Dados E.E.M. Macário BorbaAnálise dos Dados E.E.M. Macário Borba
Análise dos Dados E.E.M. Macário Borba
 
Romanico
RomanicoRomanico
Romanico
 
Risaale Razawiah 2
Risaale Razawiah 2Risaale Razawiah 2
Risaale Razawiah 2
 
Concert CAMM Quintet programa de mà
Concert CAMM Quintet programa de màConcert CAMM Quintet programa de mà
Concert CAMM Quintet programa de mà
 
Zpráva PwC Česká republika o trvale udržitelném podnikání a firemní odpovědno...
Zpráva PwC Česká republika o trvale udržitelném podnikání a firemní odpovědno...Zpráva PwC Česká republika o trvale udržitelném podnikání a firemní odpovědno...
Zpráva PwC Česká republika o trvale udržitelném podnikání a firemní odpovědno...
 
Caw 5 3
Caw 5 3Caw 5 3
Caw 5 3
 
Introduction to Python for Data Science
Introduction to Python for Data ScienceIntroduction to Python for Data Science
Introduction to Python for Data Science
 
Python for Data Science - Python Brasil 11 (2015)
Python for Data Science - Python Brasil 11 (2015)Python for Data Science - Python Brasil 11 (2015)
Python for Data Science - Python Brasil 11 (2015)
 
Lux, dove & lifebuoy. marketing mix
Lux, dove & lifebuoy. marketing mixLux, dove & lifebuoy. marketing mix
Lux, dove & lifebuoy. marketing mix
 
Sociedade e vida cotidiana na américa portuguesa
Sociedade e vida cotidiana na américa portuguesaSociedade e vida cotidiana na américa portuguesa
Sociedade e vida cotidiana na américa portuguesa
 
A case study on lifebuoy
A case study on lifebuoyA case study on lifebuoy
A case study on lifebuoy
 

Similaire à Switching from Relational to the Graph model v1.3

Design your application using Persistent Graphs and OrientDB
Design your application using Persistent Graphs and OrientDBDesign your application using Persistent Graphs and OrientDB
Design your application using Persistent Graphs and OrientDBLuca Garulli
 
Automating Drupal Development with Patterns
Automating Drupal Development with PatternsAutomating Drupal Development with Patterns
Automating Drupal Development with PatternsDavid Rozas
 
Spark forplainoldjavageeks svforum_20140724
Spark forplainoldjavageeks svforum_20140724Spark forplainoldjavageeks svforum_20140724
Spark forplainoldjavageeks svforum_20140724sdeeg
 
Dockerizing Django DRF Application
Dockerizing Django DRF ApplicationDockerizing Django DRF Application
Dockerizing Django DRF ApplicationOshane Bailey
 
Automating Drupal Development with Patterns: introducing 7.x-2.x
Automating Drupal Development with Patterns: introducing 7.x-2.xAutomating Drupal Development with Patterns: introducing 7.x-2.x
Automating Drupal Development with Patterns: introducing 7.x-2.xDavid Rozas
 
COFFEE BEAN: Full-Scale Prototype
COFFEE BEAN: Full-Scale PrototypeCOFFEE BEAN: Full-Scale Prototype
COFFEE BEAN: Full-Scale PrototypeDouglas Radecki
 
10 kickass-technologies-modern-developers-love
10 kickass-technologies-modern-developers-love10 kickass-technologies-modern-developers-love
10 kickass-technologies-modern-developers-loveHamed Hatami
 
Extracting Media Items from Multiple Social Networks
Extracting Media Items from Multiple Social NetworksExtracting Media Items from Multiple Social Networks
Extracting Media Items from Multiple Social NetworksRaphael Troncy
 
Spark For Plain Old Java Geeks (June2014 Meetup)
Spark For Plain Old Java Geeks (June2014 Meetup)Spark For Plain Old Java Geeks (June2014 Meetup)
Spark For Plain Old Java Geeks (June2014 Meetup)sdeeg
 
Austin Data Geeks - Why relationships are cool but join sucks
Austin Data Geeks - Why relationships are cool but join sucksAustin Data Geeks - Why relationships are cool but join sucks
Austin Data Geeks - Why relationships are cool but join sucksOrient Technologies
 
Communication Strategy for Open Source Projects, or How to get Engineers to T...
Communication Strategy for Open Source Projects, or How to get Engineers to T...Communication Strategy for Open Source Projects, or How to get Engineers to T...
Communication Strategy for Open Source Projects, or How to get Engineers to T...All Things Open
 
SURFconext: a next generation collaboration infrastructure across institution...
SURFconext: a next generation collaboration infrastructure across institution...SURFconext: a next generation collaboration infrastructure across institution...
SURFconext: a next generation collaboration infrastructure across institution...University of Amsterdam
 
Confessions of a not-so-secret Double Agent
Confessions of a not-so-secret Double AgentConfessions of a not-so-secret Double Agent
Confessions of a not-so-secret Double AgentDonna Benjamin
 
NoSQL and Hadoop: A New Generation of Databases - Changing the Game: Monthly ...
NoSQL and Hadoop: A New Generation of Databases - Changing the Game: Monthly ...NoSQL and Hadoop: A New Generation of Databases - Changing the Game: Monthly ...
NoSQL and Hadoop: A New Generation of Databases - Changing the Game: Monthly ...Capgemini
 
9_PDFsam_DevOps.pdf
9_PDFsam_DevOps.pdf9_PDFsam_DevOps.pdf
9_PDFsam_DevOps.pdfmadhu291670
 
Dev Fest X (Sapporo) WebGL
Dev Fest X (Sapporo) WebGLDev Fest X (Sapporo) WebGL
Dev Fest X (Sapporo) WebGLYukio Andoh
 

Similaire à Switching from Relational to the Graph model v1.3 (19)

Design your application using Persistent Graphs and OrientDB
Design your application using Persistent Graphs and OrientDBDesign your application using Persistent Graphs and OrientDB
Design your application using Persistent Graphs and OrientDB
 
Automating Drupal Development with Patterns
Automating Drupal Development with PatternsAutomating Drupal Development with Patterns
Automating Drupal Development with Patterns
 
Spark forplainoldjavageeks svforum_20140724
Spark forplainoldjavageeks svforum_20140724Spark forplainoldjavageeks svforum_20140724
Spark forplainoldjavageeks svforum_20140724
 
Entropy City
Entropy CityEntropy City
Entropy City
 
Dockerizing Django DRF Application
Dockerizing Django DRF ApplicationDockerizing Django DRF Application
Dockerizing Django DRF Application
 
Automating Drupal Development with Patterns: introducing 7.x-2.x
Automating Drupal Development with Patterns: introducing 7.x-2.xAutomating Drupal Development with Patterns: introducing 7.x-2.x
Automating Drupal Development with Patterns: introducing 7.x-2.x
 
COFFEE BEAN: Full-Scale Prototype
COFFEE BEAN: Full-Scale PrototypeCOFFEE BEAN: Full-Scale Prototype
COFFEE BEAN: Full-Scale Prototype
 
DDJ_102113
DDJ_102113DDJ_102113
DDJ_102113
 
10 kickass-technologies-modern-developers-love
10 kickass-technologies-modern-developers-love10 kickass-technologies-modern-developers-love
10 kickass-technologies-modern-developers-love
 
Extracting Media Items from Multiple Social Networks
Extracting Media Items from Multiple Social NetworksExtracting Media Items from Multiple Social Networks
Extracting Media Items from Multiple Social Networks
 
Spark For Plain Old Java Geeks (June2014 Meetup)
Spark For Plain Old Java Geeks (June2014 Meetup)Spark For Plain Old Java Geeks (June2014 Meetup)
Spark For Plain Old Java Geeks (June2014 Meetup)
 
Austin Data Geeks - Why relationships are cool but join sucks
Austin Data Geeks - Why relationships are cool but join sucksAustin Data Geeks - Why relationships are cool but join sucks
Austin Data Geeks - Why relationships are cool but join sucks
 
Communication Strategy for Open Source Projects, or How to get Engineers to T...
Communication Strategy for Open Source Projects, or How to get Engineers to T...Communication Strategy for Open Source Projects, or How to get Engineers to T...
Communication Strategy for Open Source Projects, or How to get Engineers to T...
 
SURFconext: a next generation collaboration infrastructure across institution...
SURFconext: a next generation collaboration infrastructure across institution...SURFconext: a next generation collaboration infrastructure across institution...
SURFconext: a next generation collaboration infrastructure across institution...
 
PhD thesis defense of Ajith Ranabahu
PhD thesis defense of Ajith RanabahuPhD thesis defense of Ajith Ranabahu
PhD thesis defense of Ajith Ranabahu
 
Confessions of a not-so-secret Double Agent
Confessions of a not-so-secret Double AgentConfessions of a not-so-secret Double Agent
Confessions of a not-so-secret Double Agent
 
NoSQL and Hadoop: A New Generation of Databases - Changing the Game: Monthly ...
NoSQL and Hadoop: A New Generation of Databases - Changing the Game: Monthly ...NoSQL and Hadoop: A New Generation of Databases - Changing the Game: Monthly ...
NoSQL and Hadoop: A New Generation of Databases - Changing the Game: Monthly ...
 
9_PDFsam_DevOps.pdf
9_PDFsam_DevOps.pdf9_PDFsam_DevOps.pdf
9_PDFsam_DevOps.pdf
 
Dev Fest X (Sapporo) WebGL
Dev Fest X (Sapporo) WebGLDev Fest X (Sapporo) WebGL
Dev Fest X (Sapporo) WebGL
 

Plus de Luca Garulli

Scale Out Your Graph Across Servers and Clouds with OrientDB
Scale Out Your Graph Across Servers and Clouds  with OrientDBScale Out Your Graph Across Servers and Clouds  with OrientDB
Scale Out Your Graph Across Servers and Clouds with OrientDBLuca Garulli
 
Polyglot Persistence vs Multi-Model Databases
Polyglot Persistence vs Multi-Model DatabasesPolyglot Persistence vs Multi-Model Databases
Polyglot Persistence vs Multi-Model DatabasesLuca Garulli
 
How Graph Databases started the Multi Model revolution
How Graph Databases started the Multi Model revolutionHow Graph Databases started the Multi Model revolution
How Graph Databases started the Multi Model revolutionLuca Garulli
 
OrientDB and Hazelcast
OrientDB and HazelcastOrientDB and Hazelcast
OrientDB and HazelcastLuca Garulli
 
OrientDB document or graph? Select the right model (old presentation)
OrientDB document or graph? Select the right model (old presentation)OrientDB document or graph? Select the right model (old presentation)
OrientDB document or graph? Select the right model (old presentation)Luca Garulli
 
OrientDB distributed architecture 1.1
OrientDB distributed architecture 1.1OrientDB distributed architecture 1.1
OrientDB distributed architecture 1.1Luca Garulli
 
OrientDB for real & Web App development
OrientDB for real & Web App developmentOrientDB for real & Web App development
OrientDB for real & Web App developmentLuca Garulli
 
OrientDB the database for the web 1.1
OrientDB the database for the web 1.1OrientDB the database for the web 1.1
OrientDB the database for the web 1.1Luca Garulli
 
Roma introduction and concepts
Roma introduction and conceptsRoma introduction and concepts
Roma introduction and conceptsLuca Garulli
 
OrientDB introduction - NoSQL
OrientDB introduction - NoSQLOrientDB introduction - NoSQL
OrientDB introduction - NoSQLLuca Garulli
 
RomaFramework Tutorial Basics
RomaFramework Tutorial BasicsRomaFramework Tutorial Basics
RomaFramework Tutorial BasicsLuca Garulli
 
Roma Meta Framework Concepts @JavaDay Rome 2007
Roma Meta Framework Concepts @JavaDay Rome 2007Roma Meta Framework Concepts @JavaDay Rome 2007
Roma Meta Framework Concepts @JavaDay Rome 2007Luca Garulli
 

Plus de Luca Garulli (12)

Scale Out Your Graph Across Servers and Clouds with OrientDB
Scale Out Your Graph Across Servers and Clouds  with OrientDBScale Out Your Graph Across Servers and Clouds  with OrientDB
Scale Out Your Graph Across Servers and Clouds with OrientDB
 
Polyglot Persistence vs Multi-Model Databases
Polyglot Persistence vs Multi-Model DatabasesPolyglot Persistence vs Multi-Model Databases
Polyglot Persistence vs Multi-Model Databases
 
How Graph Databases started the Multi Model revolution
How Graph Databases started the Multi Model revolutionHow Graph Databases started the Multi Model revolution
How Graph Databases started the Multi Model revolution
 
OrientDB and Hazelcast
OrientDB and HazelcastOrientDB and Hazelcast
OrientDB and Hazelcast
 
OrientDB document or graph? Select the right model (old presentation)
OrientDB document or graph? Select the right model (old presentation)OrientDB document or graph? Select the right model (old presentation)
OrientDB document or graph? Select the right model (old presentation)
 
OrientDB distributed architecture 1.1
OrientDB distributed architecture 1.1OrientDB distributed architecture 1.1
OrientDB distributed architecture 1.1
 
OrientDB for real & Web App development
OrientDB for real & Web App developmentOrientDB for real & Web App development
OrientDB for real & Web App development
 
OrientDB the database for the web 1.1
OrientDB the database for the web 1.1OrientDB the database for the web 1.1
OrientDB the database for the web 1.1
 
Roma introduction and concepts
Roma introduction and conceptsRoma introduction and concepts
Roma introduction and concepts
 
OrientDB introduction - NoSQL
OrientDB introduction - NoSQLOrientDB introduction - NoSQL
OrientDB introduction - NoSQL
 
RomaFramework Tutorial Basics
RomaFramework Tutorial BasicsRomaFramework Tutorial Basics
RomaFramework Tutorial Basics
 
Roma Meta Framework Concepts @JavaDay Rome 2007
Roma Meta Framework Concepts @JavaDay Rome 2007Roma Meta Framework Concepts @JavaDay Rome 2007
Roma Meta Framework Concepts @JavaDay Rome 2007
 

Dernier

Building AI-Driven Apps Using Semantic Kernel.pptx
Building AI-Driven Apps Using Semantic Kernel.pptxBuilding AI-Driven Apps Using Semantic Kernel.pptx
Building AI-Driven Apps Using Semantic Kernel.pptxUdaiappa Ramachandran
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7DianaGray10
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8DianaGray10
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopBachir Benyammi
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxGDSC PJATK
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfDaniel Santiago Silva Capera
 
Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Adtran
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesDavid Newbury
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Brian Pichman
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Websitedgelyza
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxMatsuo Lab
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaborationbruanjhuli
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URLRuncy Oommen
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-pyJamie (Taka) Wang
 

Dernier (20)

Building AI-Driven Apps Using Semantic Kernel.pptx
Building AI-Driven Apps Using Semantic Kernel.pptxBuilding AI-Driven Apps Using Semantic Kernel.pptx
Building AI-Driven Apps Using Semantic Kernel.pptx
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8
 
201610817 - edge part1
201610817 - edge part1201610817 - edge part1
201610817 - edge part1
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 Workshop
 
20230104 - machine vision
20230104 - machine vision20230104 - machine vision
20230104 - machine vision
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptx
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
 
Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond Ontologies
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Website
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptx
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URL
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-py
 

Switching from Relational to the Graph model v1.3

  • 1. Switching from the Relational to the Graph model Luca Garulli – Founder and CEO @NuvolaBase Ltd Author of OrientDB Doc/Graph DB Nov 29th 2012 in Riga, Latvia (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 1 www.orientechnologies.com
  • 2. Agenda 12:30 “Switching from the Relational to the Graph model” 13:30 Lunch time! (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 2
  • 3. Agenda 12:30 You’re here! “Switching from the Relational to the Graph model” 13:30 Lunch time! (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 3
  • 4. One of the main resistances of RDBMS users to pass to a NoSQL product are related to the complexity of the model: Ok, NoSQL products are super for BigData and BigScale but... (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 4
  • 5. ...what about the model? (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 5
  • 6. What is the NoSQL answer about managing complex domains? Key-Value stores ? Column-Based ? Document database ? Graph database ! (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 6
  • 7. CAUTION! This presentation will not use a social like domain with the classic paradigm of friend-of-friendN where the graph databases are already widely used... (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 7
  • 8. ...But rather we will explore how to think «graphically» with one of the most common domains in the enterprise world: The old-classic CRM* domain * today in 99% of the cases a RDBMS is used (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 8
  • 9. Every developer knows the Relational Model, but who knows the Graph one? (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 9
  • 10. Back to school: Graph Theory crash course (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 10
  • 11. Basic Graph JavaDay JavaDay Likes 2012 2012 Luca Luca Riga Riga Conference Conference (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 11
  • 12. Property Graph Model* Vertices are directed JavaDay 2012 JavaDay 2012 Luca Luca Riga Likes Riga name: Luca name: Luca surname: Garulli surname: Garulli since: 2012 Conference Conference company: NuvolaBase company: NuvolaBase date: Nov 29 2012 date: Nov 29 2012 Vertices and Edges can have properties * https://github.com/tinkerpop/blueprints/wiki/Property-Graph-Model (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 12
  • 13. Property Graph Model Likes since: 2012 JavaDay JavaDay 2012 2012 Luca Luca Speak Riga Riga s Conference ti abstra tle: «Switch Conference ct: «Th in is talk g...» presen ts...» An Edge connects 2 vertices: use multiple edges to represents 1-N and N-M relationships (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 13
  • 14. Property Graph Model Studies Oxford Oxford Luca Luca Likes located FriendOf JavaDay 2012 JavaDay 2012 Riga Riga John John Organizes Conference Conference (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 14
  • 15. Compliments, this is your diploma in «Graph Theory» (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 15
  • 16. Now go back to our domain: the CRM (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 16
  • 17. Domain: the super minimal CRM Customer Customer Address Address Registry system Order system Order Order Stock Stock (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 17
  • 18. Domain: the super minimal CRM Customer Customer Address Address How does Relational DBMS Registry system manage relationships? Order system Order Order Stock Stock (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 18
  • 19. Relational World: 1-1 Relationships Primary key Primary key Customer Address Id Name Address Id Location Foreign key 10 Luca 34 34 Rome 11 Mike 44 44 London 34 John 54 54 Oxford 56 Mark 66 66 New Mexico 88 Steve 68 68 Palo Alto JOIN Customer.Address -> Address.Id (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 19
  • 20. Relational World: 1-N Relationships Customer Address Id Name Id Customer Location 10 Luca 24 10 Rome 11 Mike 33 10 London 34 John 44 34 Oxford 56 Mark 66 56 Cologne 88 Steve 68 88 Palo Alto Inverse JOIN Address.Customer -> Customer.Id (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 20
  • 21. Relational World: N-M Relationships Customer CustomerAddress Address Id Name Id Address Id Location 10 Luca 10 24 24 Rome 11 Mike 10 33 33 London 34 John 11 44 44 Oxford 56 Mark 66 Cologne 88 Steve 68 Palo Alto Additional table with 2 JOINs (1) CustomerAddress.Id -> Customer.Id and (2) CustomerAddress.Address -> Address.Id (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 21
  • 22. Relational World: N-M Relationships Customer CustomerAddress Address Id Name Id Address Id Location 10 Luca 10 24 24 Rome 11 Mike 10 33 33 London 34 John 11 44 44 Oxford 56 Mark 66 Cologne 88 Steve 68 Palo Alto Additional table with 2 JOINs (1) CustomerAddress.Id -> Customer.Id and (2) CustomerAddress.Address -> Address.Id (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 22
  • 23. What’s wrong with the Relational Model? (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 23
  • 24. The JOIN is the evil! Customer CustomerAddress Address Id Name Id Address Id Location 10 Luca 10 24 24 Rome 11 Mike 10 33 33 London 34 John 34 24 44 Oxford 56 Mark 66 Cologne 88 Steve 68 Palo Alto These are all JOINs executed everytime you traverse a relationship! relationship (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 24
  • 25. A JOIN means searching for a key in another table The first rule to improve performance is indexing all the keys Index speeds up searches, but slows down insert, updates and deletes (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 25
  • 26. So in the best case a JOIN is a lookup into an index This is done per single join! If you traverse hundreds of relationships you’re executing hundreds of JOINs (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 26
  • 27. Index Lookup is it really that fast? (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 27
  • 28. Index Lookup: how does it works? A-Z A-L M-Z Think to an Address Book where we have to find the Luca’s phone number (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 28
  • 29. Index Lookup: how does it works? A-Z A-L M-Z A-L M-Z A-D E-L M-R S-Z Index algorithms are all similar and based on balanced trees (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 29
  • 30. Index Lookup: how does it works? A-Z A-L M-Z A-L M-Z A-D E-L M-R S-Z A-D E-L A-B C-D E-G H-L (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 30
  • 31. Index Lookup: how does it works? A-Z A-L M-Z A-L M-Z A-D E-L M-R S-Z A-D E-L A-B C-D E-G H-L E-G H-L E-F G H-J K-L (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 31
  • 32. Index Lookup: how does it works? A-Z A-L M-Z A-L M-Z Found! A-D E-L M-R S-Z This lookup took 5 A-D E-L steps and grows A-B C-D E-G H-L up with the index E-G H-L size! E-F G H-J K-L Luca (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 32
  • 33. An index lookup is executed for each JOIN Querying more tables can easily produce millions of JOINs/Lookups! Here the rule: more entries = more lookup steps = slower JOIN (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 33
  • 34. Oh! This is why performance of my database drops down when it becomes bigger, and bigger, and bigger! (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 34
  • 35. Is there a better way to manage relationships? (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 35
  • 36. “A graph database is any storage system that provides index-free adjacency” - Marko Rodriguez (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 36
  • 37. How does GraphDB manage index-free relationships? (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 37
  • 38. an Open Source (Apache licensed) document-graph NoSQL dbms (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 38
  • 39. Ø config download, unzip, run! cut & paste the db directory (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 39
  • 40. 150,000 records per second (flat records, no index, on commodity hw) (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 40
  • 41. Schema-less schema is not mandatory, relaxed model, collect heterogeneous documents all together (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 41
  • 42. Schema-full schema with constraints on fields and validation rules Customer.age > 17 Customer.address not null Customer.surname is mandatory Customer.email matches 'b[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,4}b' (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 42
  • 43. Schema-mixed schema with mandatory and optional fields + constraints the best of schema-less and schema-full modes (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 43
  • 44. ACID Transactions db.begin(); try{ // your code ... db.commit(); } catch( Exception e ) { db.rollback(); } (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 44
  • 45. Complex types native support for collections, maps (key/value) and embedded documents no more additional tables to handle them (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 45
  • 46. SQL select * from employee where name like '%Jay%' and status=0 (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 46
  • 47. runs Java everywhere is available JRE1.6+ ® robust engine (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 47
  • 48. Language bindings Java as native JRuby, PHP, C, C++, Scala, .NET, Ruby, Clojure, Node.js, Python, Javascript and more! (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 48
  • 49. JPA (partial) public class Customer { @Id private Object id; private String name; private String surname; } db.save( new Customer() ); (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 49
  • 50. Born for the Internet Supports natively HTTP/RESTful protocol Documents are transferred in JSON (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 50
  • 51. MVRB-Tree index the best of B+Tree and RB-Tree fast on browsing, low insertion cost it's a new algorithm! (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 51
  • 52. Security users and roles, encrypted passwords fine grain privileges (similar to what RDBMSs offer) (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 52
  • 53. Cache You can avoid using 3°party caches like Memcached 2 Levels of cache: Level1: Database level, 1 per thread Level2: Storage level, 1 per JVM (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 53
  • 54. Inheritance OGraphVertex (V) Person Vehicle Address : Address brand : BRANDS Customer Provider totSold : float totBuyed : float (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 54
  • 55. Polymorphic SQL Query OGraphVertex (V) Person Vehicle Address : Address brand : BRANDS select * from Person where city.name = 'Rome‘ Queries are polymorphics Customer Provider and subclasses of Person can be totSold : float totBuyed : float part of result set (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 55
  • 56. Let’s go back to the Graph Stuff How does OrientDB manage relationships? (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 56
  • 57. OrientDB: traverse a relationship The Record ID (RID) is the physical position RID = #13:35 RID = #13:35 RID = #13:100 RID = #13:100 Luca Luca Rome Rome label : :‘Customer’ label ‘Customer’ label = ‘Address’ label = ‘Address’ name : :‘Luca’ name ‘Luca’ name = ‘Rome’ name = ‘Rome’ (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 57
  • 58. OrientDB: traverse a relationship The Edge’s RID is saved inside both vertices, as «out» and «in» RID = #13:35 RID = #13:35 RID = #13:100 RID = #13:100 RID = #14:54 RID = #14:54 Lives Luca Luca Rome Rome out: [#13:35] out: [#13:35] in: [#13:100] in: [#13:100] out ::[#14:54] Label : :‘Lives’ Label ‘Lives’ in: [#14:54] out [#14:54] in: [#14:54] label : :‘Customer’ label ‘Customer’ label = ‘Address’ label = ‘Address’ name : :‘Luca’ name ‘Luca’ name = ‘Rome’ name = ‘Rome’ (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 58
  • 59. OrientDB: traverse a relationship RID = #13:35 RID = #13:35 RID = #13:100 RID = #13:100 RID = #14:54 RID = #14:54 Lives Luca Luca Rome Rome out: [#13:35] out: [#13:35] in: [#13:100] in: [#13:100] out ::[#14:54] Label : :‘Lives’ Label ‘Lives’ in: [#14:54] out [#14:54] in: [#14:54] label : :‘Customer’ label ‘Customer’ label = ‘Address’ label = ‘Address’ name : :‘Luca’ name ‘Luca’ name = ‘Rome’ name = ‘Rome’ (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 59
  • 60. OrientDB: traverse a relationship RID = #13:35 RID = #13:35 RID = #13:100 RID = #13:100 RID = #14:54 RID = #14:54 Lives Luca Luca Rome Rome out: [#13:35] out: [#13:35] in: [#13:100] in: [#13:100] out ::[#14:54] Label : :‘Lives’ Label ‘Lives’ in: [#14:54] out [#14:54] in: [#14:54] label : :‘Customer’ label ‘Customer’ label = ‘Address’ label = ‘Address’ name : :‘Luca’ name ‘Luca’ name = ‘Rome’ name = ‘Rome’ (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 60
  • 61. GraphDB handles relationships as a physical LINK to the record assigned when the edge is created on the other side RDBMS computes the relationship every time you query a database Is not that crazy?! (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 61
  • 62. This means jumping from a O(log N) algorithm to a near O(1) traversing cost is not more affected by database size! This is huge in the BigData age (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 62
  • 63. OrientDB in the Blueprints micro-benchmark, on common hw, with a hot cache, traverses 29,6 Millions of records in less than 5 seconds about 6 Millions of nodes traversed per sec! Do not try this at home with a RDBMS*! *unless you live in the Google’s server farm (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 63
  • 64. Create the graph in SQL $luca> cd bin $luca> ./console.sh OrientDB console v.1.3.0-SNAPSHOT (www.orientdb.org) Type 'help' to display all the commands supported. orientdb> create vertex Customer set name = ‘Luca’ Created vertex #13:35 in 0.03 secs orientdb> create vertex Address set name = ‘Rome’ Created vertex #13:100 in 0.02 secs orientdb> create edge Lives from #13:35 to #13:100 Created edge #14:54 in 0.02 secs (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 64
  • 65. Create the graph in Java OGraphDatabase graph = new OGraphDatabase("local:/tmp/db/graph”); ODocument luca = graph.createVertex(“Customer"); luca.field(“name", “Luca"); ODocument rome = graph.createVertex(“Address”); rome.field(“name", “Rome”); ODocument edge = graph.createEdge(luca, rome, “Lives”); edge.save(); graph.close(); (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 65
  • 66. Query the graph in SQL orientdb> select in.out from Address where name = ‘Rome’ ---+------+---------|--------------------+--------------------+--------+ #| RID |@class |label |out |in | ---+------+---------+--------------------+--------------------+--------+ 0| 13:35|Customer |Luca |[#14:54] | | ---+------+---------+--------------------+--------------------+--------+ 1 item(s) found. Query executed in 0.007 sec(s). Incoming vertices (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 66
  • 67. More on query power orientdb> select sum( out.in[@class=‘Order’].total ) from Customer where name = ‘Luca’ orientdb> traverse Customer.out, Friend.in from Customer while $depth <= 7 orientdb> select from ( traverse Customer.out, Friend.in from Customer while $depth <= 7 ) where @class=‘Customer’ and city.name = ‘Riga’ (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 67
  • 68. Query vs traversal Once you’ve a well connected database in the form of a Super Graph you can cross records instead of query them! All you need is some root vertices where to start traversing (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 68
  • 69. Query vs traversal Special Special Customers Customers Stocks Stocks Customers Customers Luca Luca John John Sylvia Sylvia White White This is a Soap Soap root vertex Order Order Order Order 2332 2332 8834 8834 (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 69
  • 70. This is your database (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 70
  • 71. Get last customer bought Whisky select last(out.in[@class=‘Order’].out.in[@class=‘Customer’]) from Stock where name = ‘Whisky’ (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 71
  • 72. Get it’s country select out.in[@class=‘city’] from #34:22 Riga, Latvia (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 72
  • 73. Get orders from that country select in.out[@class=‘Customer’] from #55:12 (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 73
  • 74. NuvolaBase.com HTTP/REST HTTP/REST The first Graph Database as a Service on the Cloud (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 74
  • 75. Do we have enough time for live demo? (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 75
  • 76. Questions & (maybe) Answers Luca Garulli CEO at Document-Graph NoSQL Open Source project Ltd, London UK www.twitter.com/lgarulli Conclusion as last -> (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 76
  • 77. Summary 1)JOIN is heavy, specially on large databases 2)GraphDB uses LINK as direct pointers to records: times from O(log)N to near O(1) = ready for the BigData 3) GraphDB has a query language specialized to traverse relationships (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 77
  • 78. Let’s move like a Spider on the web (c) Luca Garulli Licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License Page 78