Graph Database是新型態的nosql資料庫，以圖為基底勾勒出現實世界中複雜的關係架構。可利用此特性處理網站中巨大流量及複雜資料查找的解決方案之一，換個角度思考設計或許能更快更有效率解決問題。 本次分享將經驗分享如何設計出Graph模式的資料結構，並實戰上億資料量及大流量的查找。 處理複雜資料一直是影響ＷＥＢ效能最關鍵主因，希望透過實作的經驗分享能給聽眾新的角度思考不同作法

1. Graph Database

2. •
•
•
•
• freddyfan1011@gmail.com

3. GraphDB

4. GraphDB

5. NOSQL
https://www.simplilearn.com/introduction-to-nosql-
databases-tutorial-video

6. Graph
https://zh.wikipedia.org/wiki/%E5%9B%BE
%E6%95%B0%E6%8D%AE%E5%BA%93

7. A

8. Facebook

9. https://www.flickr.com/photos/editor/4537962343
Social Network

10. raph
• 1.
• 2.
• 3.
• 4.
- Graph

11. GraphDB
https://cambridge-intelligence.com/visualize-arangodb/

12. 1. raph Document KeyValue
2. JavaScript framework Foxx™
3. AQL(ArangoDB query language )
4. ( ) Cluster
5. ( )
6.

13. Graph

14. •
•
• 100

15. •
•
•

16. JOIN
•
•
• 100 100

18. •
•
•

20. Graph
INBOUND / OUTBOUND

21. AQ
For v,e,p IN 1..1 OUTBOUND concat(‘A_cust/A123456789’)
GRAPH ‘Coupon’
FILTER p.vertices[1].START <= DATE_NOW()
AND p.vertices[1].END >=DATE_NOW()
AND p.edges[0].GET==‘1’
COLLECT WITH COUNT INTO COUPON_COUNT
RETURN COUPON_COUNT

22. For v,e,p IN 1..1 OUTBOUND concat(‘A_cust/A123456789’)
GRAPH ‘Coupon’
v : vertex
e : edge
p : path
1..1 min..max
INBOUND / OUTBOUND
GRAPH graphName [0]
[1]

23. •
FILTER p.vertices[1].START <= DATE_NOW()
AND p.vertices[1].END >=DATE_NOW()
AND p.edges[0].GET==‘1’
COLLECT WITH COUNT INTO COUPON_COUNT
RETURN COUPON_COUNT

24. • Graph vertex vertex
• edge
• Document JOIN Graph
• Graph

26. • JavaScript framework : FOXX
• Apache JMeter
• 4 CPU+32G RAM
• uery 2000 /
• 2 /

27. •
• Signal
• Master-Slave
• luster

28. https://www.arangodb.com/why-arangodb/cluster/

29. • Coordinator DB Server
• DB Server Shards
• DB Server

30. • 1. DB Server
• 2. ARCHIVE LOG Master
Slave
A B C
replicate replicate

31. • 3 Signal
• 3
Load Balance

32. Graph

33. Big Data
•
•
•
•
•
•

34. •
•
•

35. Thank You