Slide 1

Slide 1 text

DISCOVERING GRAPH STRUCTURES Mariusz Gil

Slide 2

Slide 2 text

ABOUT ME

Slide 3

Slide 3 text

DEVELOPER / TECH-LEAD / CONSULTANT

Slide 4

Slide 4 text

No content

Slide 5

Slide 5 text

INSPIRATION IS BETTER THAN SOLUTION

Slide 6

Slide 6 text

DATA

Slide 7

Slide 7 text

CRUCIAL VERY THING IN YOUR APP

Slide 8

Slide 8 text

CRUCIAL MOST THING IN YOUR APP STORING PROCESSING

Slide 9

Slide 9 text

90+

Slide 10

Slide 10 text

WHY?

Slide 11

Slide 11 text

90+ HYPOTHESIS

Slide 12

Slide 12 text

dev developers struct set list tree graph … SQL(struct)

Slide 13

Slide 13 text

WE ALL SPEAK SQL* * INCLUDING 3NF THIS IS OUR WAY TO WORK WITH DATA

Slide 14

Slide 14 text

7MB QUERY

Slide 15

Slide 15 text

STORING PROCESSING

Slide 16

Slide 16 text

90+ HYPOTHESIS EXTENDED

Slide 17

Slide 17 text

dev developers struct set list tree graph … SQL(JSON(struct))

Slide 18

Slide 18 text

No content

Slide 19

Slide 19 text

No content

Slide 20

Slide 20 text

No content

Slide 21

Slide 21 text

No content

Slide 22

Slide 22 text

GRAPHS

Slide 23

Slide 23 text

POWERFUL SINCE 1736

Slide 24

Slide 24 text

C A GRAPH = (VERTICES, EDGES) B

Slide 25

Slide 25 text

C A SPARSE GRAPH B D C A COMPLETE GRAPH B D C A DENSE GRAPH B D ADJACENCY LIST ADJACENCY MATRIX

Slide 26

Slide 26 text

DIGRAPH = (VERTICES, DIRECTED EDGES) C A B

Slide 27

Slide 27 text

type: KNOWS VERTICES AND EDGES PROPERTIES B type: NOTHING A type: PERSON name: John Snow

Slide 28

Slide 28 text

GRAPHS IN REAL LIFE

Slide 29

Slide 29 text

No content

Slide 30

Slide 30 text

Open In progress Resolved Reopened Closed

Slide 31

Slide 31 text

task_id task_status 1 1 2 3 3 2 4 4 Open In progress Resolved Reopened Closed

Slide 32

Slide 32 text

use Finite\StatefulInterface; class Document implements StatefulInterface { private $state; public function setFiniteState($state) { $this->state = $state; } public function getFiniteState() { return $this->state; } }

Slide 33

Slide 33 text

use Finite\StateMachine\StateMachine; use Finite\State\State; use Finite\State\StateInterface; // $document = retrieve your stateful object $sm = new StateMachine(); // Define states $sm->addState( new State('s1', StateInterface::TYPE_INITIAL) ); $sm->addState('s2'); $sm->addState('s3'); $sm->addState( new State('s4', StateInterface::TYPE_FINAL) );

Slide 34

Slide 34 text

s4 s3 s2 // Define transitions $sm->addTransition('t12', 's1', 's2'); $sm->addTransition('t23', 's2', 's3'); $sm->addTransition('t34', 's3', 's4'); $sm->addTransition('t42', 's4', 's2'); // Initialize $sm->setObject($document); $sm->initialize(); // Retrieve current state $sm->getCurrentState(); // Can we process a transition? $sm->can('t34'); s1

Slide 35

Slide 35 text

HUNDREDS TRANSITIONS TENS OF MODELS ONE ACTION DRY HUNDREDS OF THOUSANDS OBJECTS IN DB

Slide 36

Slide 36 text

/** * @Route("/change-state") */ public function changeStateAction() { // Get model // ... // Check user permissions // ... // Check transition and notify observers if ($model->isTransitionAllowed($targetState) { $model->setState($targetState); // Save change // ... } // Finish // ... }

Slide 37

Slide 37 text

E C G F B A D H I J K L M

Slide 38

Slide 38 text

E C G F B A D H I J 1:30 1:30 1:00 1:45 0:45 0:45 3:00 1:15 1:00 0:40 0:20 0:30 0:30 K L M

Slide 39

Slide 39 text

@tom @bob @john #php #js #web Tweet X search tweet retweet favourite contains search search search follow follow search contains search

Slide 40

Slide 40 text

require_once 'vendor/autoload.php'; use \Fhaculty\Graph\Graph as Graph; $graph = new Graph(); // Create some cities $rome = $graph->createVertex('Rome'); $madrid = $graph->createVertex('Madrid'); $cologne = $graph->createVertex('Cologne'); //Bbuild some roads $cologne->createEdgeTo($madrid); $madrid->createEdgeTo($rome); // create loop $rome->createEdgeTo($rome); // Process foreach ($rome->getVerticesEdgeFrom() as $vertex) { echo $vertex->getId().' leads to rome’ . PHP_EOL; }

Slide 41

Slide 41 text

require_once 'vendor/autoload.php'; $graph = new Fhaculty\Graph\Graph(); $blue = $graph->createVertex('blue'); $blue->setAttribute('graphviz.color', 'blue'); $red = $graph->createVertex('red'); $red->setAttribute('graphviz.color', 'red'); $edge = $blue->createEdgeTo($red); $edge->setAttribute('graphviz.color', 'grey'); $graphviz = new Graphp\GraphViz\GraphViz(); $graphviz->display($graph);

Slide 42

Slide 42 text

SEARCH SHORTEST PATH SPANNING TREES TRAVELING SALESMAN PROBLEM MAXIMUM FLOW MINIMUM COST FLOW MAXIMUM MATCHING ALGORITHMS

Slide 43

Slide 43 text

TYPICAL SQL-WAY C A B mysql> SELECT * FROM `nodes`; +----+------+ | id | name | +----+------+ | 1 | A | | 2 | B | | 3 | C | +----+------+ 3 rows in set (0,00 sec) mysql> SELECT * FROM `edges`; +--------+--------+ | s_node | e_node | +--------+--------+ | 1 | 2 | | 2 | 3 | | 3 | 1 | +--------+--------+ 3 rows in set (0,00 sec) CREATE TABLE `nodes` ( `id` int(11) NOT NULL auto_increment, `name` varchar(64) NOT NULL, PRIMARY KEY (`id`) ) ENGINE=InnoDB; CREATE TABLE `edges` ( `s_node` int(11) NOT NULL, `e_node` int(11) NOT NULL, PRIMARY KEY (`s_node`,`e_node`), ) ENGINE=InnoDB;

Slide 44

Slide 44 text

TYPICAL SQL-WAY C A B mysql> SELECT * FROM `nodes`; +----+------+ | id | name | +----+------+ | 1 | A | | 2 | B | | 3 | C | +----+------+ 3 rows in set (0,00 sec) mysql> SELECT * FROM `edges`; +--------+--------+-------+ | s_node | e_node | float | +--------+--------+-------+ | 1 | 2 | 6.50 | | 2 | 3 | 4.75 | | 3 | 1 | 10.00 | +--------+--------+-------+ 3 rows in set (0,00 sec) CREATE TABLE `nodes` ( `id` int(11) NOT NULL auto_increment, `name` varchar(64) NOT NULL, PRIMARY KEY (`id`) ) ENGINE=InnoDB; CREATE TABLE `edges` ( `s_node` int(11) NOT NULL, `e_node` int(11) NOT NULL, `weight` float NOT NULL, PRIMARY KEY (`s_node`,`e_node`), ) ENGINE=InnoDB; 10.00 6.50 4.75

Slide 45

Slide 45 text

No content

Slide 46

Slide 46 text

LARGE MEDIUM SMALL

Slide 47

Slide 47 text

GRAPH ORIENTED DATABASE

Slide 48

Slide 48 text

INSTALL

Slide 49

Slide 49 text

SINGLE NODE SETUP wget -O - http://debian.neo4j.org/neotechnology.gpg.key | apt-key add - echo 'deb http://debian.neo4j.org/repo stable/' > /etc/apt/sources.list.d/neo4j.list apt-get update apt-get install neo4j service neo4j-service status LINUX EDITION

Slide 50

Slide 50 text

No content

Slide 51

Slide 51 text

RUN

Slide 52

Slide 52 text

No content

Slide 53

Slide 53 text

QUERY

Slide 54

Slide 54 text

No content

Slide 55

Slide 55 text

LIVE DEMO

Slide 56

Slide 56 text

require_once 'vendor/autoload.php'; use Neoxygen\NeoClient\ClientBuilder; $client = ClientBuilder::create() ->addConnection('default') ->setAutoFormatResponse(true) ->build(); $query = 'MATCH (n)-[r]->(m) RETURN *'; $nodes = $client->sendCypherQuery($query) ->getResult() ->getNodes(); foreach ($nodes as $node) { echo sprintf( "%s %s:" . PHP_EOL, $node->getLabel(), $node->getProperty("name") ); }

Slide 57

Slide 57 text

No content

Slide 58

Slide 58 text

http://graphdatabases.com

Slide 59

Slide 59 text

ALTERNATIVES

Slide 60

Slide 60 text

No content

Slide 61

Slide 61 text

No content

Slide 62

Slide 62 text

No content

Slide 63

Slide 63 text

TOOLS WILL CHANGE IDEAS ARE IMMORTAL

Slide 64

Slide 64 text

Dijkstra's algorithm is an algorithm for finding ______________ in graph

Slide 65

Slide 65 text

@mariuszgil THANKS! https://joind.in/14886