Neo4j笔记.rar_nosql_neo4j_NoSQL_数据库系统下载-pudn.com

<html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"> <link rel="stylesheet" href="https://static.pudn.com/base/css/base.min.css"> <link rel="stylesheet" href="https://static.pudn.com/base/css/fancy.min.css"> <link rel="stylesheet" href="https://static.pudn.com/prod/directory_preview_static/6278f39ad7996104df777112/raw.css"> <script src="https://static.pudn.com/base/js/compatibility.min.js"></script> <script src="https://static.pudn.com/base/js/pdf2htmlEX.min.js"></script> <script> try{ pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({}); }catch(e){} </script> <title></title> </head> <body> <div id="sidebar" style="display: none"> <div id="outline"> </div> </div> <div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="https://static.pudn.com/prod/directory_preview_static/6278f39ad7996104df777112/bg1.jpg"><div class="c x0 y1 w2 h2"><div class="t m0 x1 h3 y2 ff1 fs0 fc0 sc0 ls0 ws0">图数据库介绍</div><div class="t m0 x1 h3 y3 ff2 fs0 fc0 sc0 ls0 ws0">1.<span class="_ _0"> </span><span class="ff1">图论中 节点</span>+<span class="ff1">边 —— 节点</span>+<span class="ff1">关系</span></div><div class="t m0 x1 h3 y4 ff2 fs0 fc0 sc0 ls0 ws0">2.<span class="_ _0"> </span><span class="ff1">关系型数据库中处理多对多的关系时需要创建多个中间表，出现多个<span class="_ _1"> </span></span>join</div><div class="t m0 x1 h3 y5 ff2 fs0 fc0 sc0 ls0 ws0">3.<span class="_ _0"> </span><span class="ff1">图数据库通过边来表示两个事物之间的关系，不限数量，不限方向，方便处理复杂的数</span></div><div class="t m0 x1 h3 y6 ff1 fs0 fc0 sc0 ls0 ws0">据关系（这时使用关系型数据库时，会造成表空间的浪费和性能的下降）</div><div class="t m0 x1 h3 y7 ff2 fs0 fc0 sc0 ls0 ws0">4.<span class="_ _0"> </span><span class="ff1">交通<span class="_ _2"></span>网络<span class="_ _2"></span> <span class="_ _2"></span>复杂<span class="_ _2"></span>的关<span class="_ _2"></span>系网<span class="_ _2"></span>络，<span class="_ _2"></span>计算<span class="_ _2"></span>哪些<span class="_ _2"></span>交通<span class="_ _2"></span>路线<span class="_ _2"></span>是有<span class="_ _2"></span>交集<span class="_ _2"></span>的，<span class="_ _2"></span>那条<span class="_ _2"></span>交通<span class="_ _2"></span>路线<span class="_ _2"></span>是通<span class="_ _2"></span>往那<span class="_ _2"></span>个</span></div><div class="t m0 x1 h3 y8 ff1 fs0 fc0 sc0 ls0 ws0">终点的，用图数据库比较方便。</div><div class="t m0 x1 h3 y9 ff1 fs0 fc0 sc0 ls0 ws0">图数据基本元素与概念</div><div class="t m0 x1 h3 ya ff2 fs0 fc0 sc0 ls0 ws0">1.<span class="_ _0"> </span><span class="ff1">节点<span class="_ _1"> </span></span>Node——<span class="ff1">基本元素，表示以一个实体记录</span></div><div class="t m0 x1 h3 yb ff2 fs0 fc0 sc0 ls0 ws0"> Lable<span class="_"> </span><span class="ff1">标签（如：</span>P<span class="_ _3"></span>erson<span class="ff1">、</span>T<span class="_ _4"></span>eacher<span class="ff1">，可以存多个标签）</span></div><div class="t m0 x1 h3 yc ff2 fs0 fc0 sc0 ls0 ws0"> Property<span class="_ _1"> </span><span class="ff1">属性 （如<span class="_ _1"> </span></span>id<span class="ff1">）</span></div><div class="t m0 x1 h3 yd ff2 fs0 fc0 sc0 ls0 ws0">2.<span class="_ _0"> </span><span class="ff1">关系——节点与节点之间的关系</span></div><div class="t m0 x1 h3 ye ff2 fs0 fc0 sc0 ls0 ws0"> T<span class="_ _3"></span>ype<span class="_ _1"> </span><span class="ff1">类型（<span class="fc1">只能有一个</span>）</span></div><div class="t m0 x1 h3 yf ff2 fs0 fc0 sc0 ls0 ws0"> Property<span class="_ _1"> </span><span class="ff1">属性（可以有多个，如<span class="_ _1"> </span></span>id<span class="ff1">）</span></div><div class="t m0 x1 h3 y10 ff2 fs0 fc0 sc0 ls0 ws0"> <span class="ff1">两个节点之间可以存在多个关系</span></div><div class="t m0 x1 h3 y11 ff2 fs0 fc0 sc0 ls0 ws0"> <span class="ff1">也可以头结点和尾结点是同一个节点</span></div><div class="t m0 x1 h3 y12 ff2 fs0 fc0 sc0 ls0 ws0">3.<span class="_ _0"> </span><span class="ff1">属性的存储类型</span></div><div class="t m0 x1 h3 y13 ff2 fs0 fc0 sc0 ls0 ws0">4.<span class="_ _0"> </span><span class="ff1">路径——节点和关系之间存在的一个路径</span></div><div class="t m0 x1 h3 y14 ff2 fs0 fc0 sc0 ls0 ws0"> <span class="ff1">单独一个节点路径为<span class="_ _1"> </span></span>0<span class="ff1">，若两个节点只存在一条关系，路径的长度为<span class="_ _1"> </span></span>1 </div><div class="t m0 x1 h3 y15 ff2 fs0 fc0 sc0 ls0 ws0">Cypher<span class="_"> </span><span class="ff1">语句基本操作</span></div><div class="t m0 x1 h3 y16 ff2 fs0 fc0 sc0 ls0 ws0">1.<span class="_ _0"> </span><span class="ff1">创建一个节点</span></div><div class="t m0 x1 h4 y17 ff2 fs0 fc0 sc0 ls0 ws0"> crea<span class="_ _3"></span>te(n:Per<span class="_ _3"></span>son{name:'william',age:'5',sex:'male'}) return n</div><div class="t m0 x1 h3 y18 ff2 fs0 fc0 sc0 ls0 ws0">2.<span class="_ _0"> </span><span class="ff1">由属性删除一个节点</span></div><div class="t m0 x1 h4 y19 ff2 fs0 fc0 sc0 ls0 ws0"> match(n:P<span class="_ _3"></span>erson{name:'william'}) delete n</div><div class="t m0 x1 h3 y1a ff2 fs0 fc0 sc0 ls0 ws0"> <span class="ff1">由<span class="_ _1"> </span></span>id<span class="_"> </span><span class="ff1">删除一个节点</span></div><div class="t m0 x1 h4 y1b ff2 fs0 fc0 sc0 ls0 ws0"> match(n) wher<span class="_ _3"></span>e id(n)=0 delete n</div><div class="t m0 x1 h3 y1c ff2 fs0 fc0 sc0 ls0 ws0">3.<span class="_ _0"> </span><span class="ff1">创建实体同时创建关系</span></div><div class="t m0 x1 h4 y1d ff2 fs0 fc0 sc0 ls0 ws0"> crea<span class="_ _3"></span>te(n:Per<span class="_ _3"></span>son{name:'william'})-[:son]->(m:Perso<span class="_ _3"></span>n{name:'yomi'})</div><div class="t m0 x1 h3 y1e ff2 fs0 fc0 sc0 ls0 ws0"> <span class="ff1">只创建关系</span></div><div class="t m0 x1 h4 y1f ff2 fs0 fc0 sc0 ls0 ws0"> match(n:P<span class="_ _3"></span>erson{name:'sam'}),(m:P<span class="_ _3"></span>erson{name:'y<span class="_ _3"></span>omi'}) </div></div></div><div class="pi" data-data='{"ctm":[1.611850,0.000000,0.000000,1.611850,0.000000,0.000000]}'></div></div> </body> </html>