OrientDB the graph database

1.0
May
2012

www.orientechnologies.com

Artem Orobets
Senior Java Developer
in ExigenServices
1.5 year in Java

OrientDB committer

Andrey Lomakin
Software Architect
in ExigenServices
6+ years JEE experience

OrientDB committer

OrientDB
=
best features of newest NoSQL
solutions
+
best features of Relational DBMS
+
True Graph engine

Relationships
are direct links
no Relational JOINS to connect multiple tables
Load trees and graphs in few ms!


Complex types
native support for collections, maps
(key/value)
and embedded documents
no more additional tables to handle them


Schema-mixed
schema with mandatory and optional fields + constraints
the best of schema-less and schema-full modes


ACID Transactions
db.begin();

try{
// your code
...
db.commit();

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

SQL
select * from employee where name like '%Jay%' and status=0


SELECT SUM(price) as prices, SUM(cost) as costs, prices-costs, margin/price
FROM Balance

VS
function (key, values) {
var price = 0.0, cost = 0.0, margin = 0.0, marginPercent = 0.0;
for (var i = 0; i < values.length; i++) {
price += values[i].price;
cost += values[i].cost;
}
margin = price - cost;
marginPercent = margin / price;
return {
price: price,
cost: cost,
margin: margin,
marginPercent: marginPercent
};
}

SQL & relationships
select from Account where address.city.country.name = 'Italy'

select from Account where addresses contains (city.country.name = 'Italy')


SQL & schema-
less
select from Profile where any() like '%Jay%'

select from Stock where all() is not null


HTTP
RESTful
firewall friendly
use it from the webbrowser
use it from the ESB (SOA)

Native
{
JSON
'@rid' = '26:10',
'@class' = 'Developer',
'name' : 'Luca',
'surname' : 'Garulli',
'out' : [ #10:33, #10:232 ]
}

Binary protocol
available for Java
and soon C, C++ and Ruby


MVRB-Tree index
the best of B+Tree and RB-Tree
fast on browsing, low insertion cost


Hooks
similar to triggers
catch events against records, database and transactions
implement custom cascade deletion algorithm
enforce constraints


Security
users and roles, encrypted
passwords
fine grain privileges


Multi-Master architecture
any node can read/write to the database
this scale up horizontly
adding nodes is straightforward

The actors
Leader Node Only 1 per Leader per cluster, checks other nodes and
notify changes to other Peer Nodes.

Any server node in the cluster. Has a permanent
Peer Node connection to the Leader Node
Clients are connected to Server Nodes no matter if Leader
Client
or Peer

Database Database, where data are stored

Synchronous mode replication.

Asynchronous mode replication.

Cluster auto-discovering
At start up each Server Node sends a IP Multicast message in broadcast to
discover if any Leader Node is available to join the cluster.

Server #1
(Leader) DB DB
DB DB
DB DB

Server #2
(Peer)

DB DB
DB DB
DB DB

One Leader Multiple Peers
The first node to start is always the Leader but in case of failure can be elected
any other.

Server #1
(Leader) DB DB
DBDB
DB DB

Server #2 Server #3
(Peer) (Peer)

DB DB
DBDB
DB DB DB DB
DBDB
DB

Security
To join a cluster the Server Node has to configure the cluster name and
password
Broadcast messages are encrypted using the password

Server #1
(Leader)

Server #2 Join the cluster
(Peer) ONLY
If knows the name
DB DB
DB DB
DB DB and password

Multiple clusters
Multiple separate clusters can coexist in the same network
Clusters can't see each others. Are separated boxes
What identify a cluster is name + password
Cluster 'A', password
'aaa'

Server #1 Cluster 'B', password
(Leader) 'bbb'

Server #2 Server #1
(Peer) (Leader)
Server #3
(Peer) Server #2
(Peer)
Server #3
(Peer)

Synchronous Replication
Guarantees two databases are always consistent
More expensive than asynchronous

Server #1 Server #2

DB-1 DB-2

Synchronous Replication
steps
Client #1
6) Sends back OK to Client
1) Update record #1
request 3) Propagates the
update
Server #1 Server #2

2) Update record to DB-1 5) Sends back OK to Server #1 4) update record to DB-2

DB-1 DB-2

Asynchronous Replication
Changes are propagated without waiting for the answer
Two databases could be not consistent in the range of few
ms

Server #1 Server #2

DB-1 DB-2

Asynchronous Replication
steps
(4a and 4b are executed in parallel)

Client #1
4a) Sends back OK to Client #1
1) Update record request
3) Propagates the update

Server #1 Server #2
2) Update record to DB-1 4b) update record to DB-2

DB-1 DB-2

Conflict Management
The conflicts resolution strategy can be plugged by
providing implementations of the
OReplicationConflictResolver interface

Server #2

Conflict Strategy DB-2

Conflict Management
Default strategy

Server #2
Default implementation:
Conflict mark is created
Default
and conflict should be Conflict
DB-2
resolved manually Strategy

Conflict Log

Graph Database model
wrapper on top of Document Database
Few simple concepts: Vertex, Edge,
Property and Index


2 different API
OGraphDatabase All APIs
Native, damn fast, not the most beautiful API are compatible
among them!
So use the
right one
for the right
case

OrientGraph
TinkerPop Blueprints, slowest but:
common to other impls, Gremlin, SPARQL


TinkerPop technologies
sort of “standard” for GraphDB
a lot of free open-source projects

http://tinkerpop.com


TinkerPop Blueprints
basic API to interact with GraphDB
implements transactional and
indexable property graph model
bidirectional edges


TinkerPop Gremli
scripting language
easy to learn and understand
Used for operations against graphs


g.v(89).outE('followed_by')
.inV.outE('sung_by')
.inV.has('name','Garcia').back(3).name

Inheritance
OgraphVertex (V) OgraphEdge (E)

Person Works Reside Knows
Vehicle
Address :
Address
brand : BRANDS s
since : since : Date Level :
Date till : Date LEVELS

Custome Provider
r totBuyed :
totSold : float float


Polymorphic SQL Query
List<ODocument> result = database.query( new
OSQLSynchQuery(

"select from Person where city.name = 'Rome'" ));

Queries are polymorphics
and subclasses of Person can be
part of result set


Fetch plans
Choose what to fetch on query and vertexes/edges loading
Vertexes/Edges not fetched will be lazy-loaded on request
Optimizes network latency


Fetch plans
Load only the root vertex
Vertex = *:1
Luca
|
| lives city
+---------> Vertex ------------> Vertex
| 10th street Italy
| knows
+--------->* [Vertex Vertex Vertex ]
[ Marko John Nicholas]


Fetch plans
Load root + address
Vertex = *:1 lives:2
Luca
|
| lives city
+---------> Vertex ------------> Vertex
| 10th street Italy
| knows


Fetch plans
Load root + all known
Vertex = *:1 knows:1
Luca
|
| lives city
+---------> Vertex ------------> Vertex
| 10th street Italy
| knows


Fetch plans
Load up 3rd level of depth
Vertex = *:3
Luca
|
| lives city
+---------> Vertex ------------> Vertex
| 10th street Italy
| knows


Console
ORIENT database v.1.0.0 www.orientechnologies.com
Type 'help' to display all the commands supported.

> connect remote:localhost/demo admin admin
Connecting to database [remote:localhost/demo] with user 'admin'...OK

> select from profile where nick.startsWith('L')
---+--------+--------------------+--------------------+--------------------+
#| REC ID |NICK |SEX |AGE |
---+--------+--------------------+--------------------+--------------------+
0| 10:0|Lvca |male |34
1| 10:3|Leo |male |22
2| 10:7|Luisa |female |27
3 item(s) found. Query executed in 0.013 sec(s).

> close
Disconnecting from the database [demo]...OK

> quit

OrientDB Studio/SQL query

Resultset is editable and
changes are immediately
persistent!


OrientDB Studio/View graph


Upcoming features
New hash Indexes,
query performance boost,
data consistency check,
new transaction lock mechanics,
object DB improvements

Production usage
Finance Solutions Of America

NuvolaBase.com (beta)

The first
Graph Database
on the Cloud
always available
few seconds to setup it
use it from app & mobile

User’s reasons to chose
Only one graph DB with cloud computing
support, high flexibility of data format,
powerful data analyzes (SQL + Gremlin),
JDBC driver, huge reduction of integration
time, good technical support.

Blueprints microbenchmarks
Module OrientDB Neo4j DEX

Release 1.0-SNAPSHOT 1.7M03 4.5.1
VertexTestSuite 11,628.98 30,535.02 4,686.65
EdgeTestSuite 7,712.06 41,206.89 58,671.90
GraphTestSuite 9,073.09 55,102.35 7,428.25
IndexableGraphTestSuite 4,620.61 11,299.02 1070.75
IndexTestSuite 2,072.23 5,239.92 not supported
AutomaticIndexTestSuite 3,252.48 9,402.59 not supported

TransactionGraphTestSuite 7,659.67 22,787.29 not supported

GraphMLReaderTestSuite 4,064.23 5,440.67 not supported

git clone git://github.com/tinkerpop/blueprints.git
mvn clean install

Always Free
Open Source Apache 2 license
free for any purposes,
even commercials


No dependencies
with 3rd parties software
no conflicts with other
software
just 1 Mb of run-time libraries


Ø config
download, unzip, run!
cut & paste the db

Luca Garulli
Founder of OrientDB

Andrey Lomakin
Committer of OrientDB

Artem Orobets
@lgarulli, Commiter of OrientDB

@Andrey_Lomakin,
@Dr_EniSh


OrientDB the graph database

Recommandé

Recommandé

Contenu connexe

Tendances

Tendances (19)

En vedette

En vedette (15)

Similaire à OrientDB the graph database

Similaire à OrientDB the graph database (20)

Dernier

Dernier (20)

OrientDB the graph database