In the SNS domain, Response time of Friend Suggestion Algorithms and several SNA algorithms is in direct proportion to square of relationship number. In addition, increasing rate of relationship number is bigger and bigger. But existing usage pattern of Relational DB is suffering poor performance. To guarantee performance and scalability, we have developed such methods for Friend Suggestion and SNA
Relation Pruning using intimacy value
No Join & Keeping all Data in-Memory Strategy
Distributed Graph Structure
10. Next Contents
SNS 豺蟲豢豌
豺蟲豢豌 螻襴讀
Friend of a Friend 豢豌
Close Friend of a Close Friend 豢豌
豺蟲豢豌 ろ 蟲
蟆磯 覦 ロ
10
11. Friend of a Friend (FOAF) 豢豌
F(A, B) = A, B螳 豺蟲蟯螻企 True
M.F.C(A, C) = A, C 螻牛旧蟲 (Mutual Friend Count)
A 豢豌豺蟲 讌 = F(A, B) 願 F(B, C) Cれ 讌
螳螳 C襷 M.F.C(A, C)螳 朱
First
豺蟲1 伎
螳蠍語企 豺蟲2 讌ル襭
豺蟲3 ル
Jilin Chen, (2009), Recommending People on Social Networking Sites.
11
12. Friend of a Friend (FOAF) 豢豌
F(A, B) = A, B螳 豺蟲蟯螻企 True
M.F.C(A, C) = A, C 螻牛旧蟲 (Mutual Friend Count)
A 豢豌豺蟲 讌 = F(A, B) 願 F(B, C) Cれ 讌
螳螳 C襷 M.F.C(A, C)螳 朱
豺蟲1 伎
螳蠍語企 豺蟲2 讌ル襭
Second
豺蟲3 ル
Jilin Chen, (2009), Recommending People on Social Networking Sites.
12
13. Friend of a Friend (FOAF) 豢豌
F(A, B) = A, B螳 豺蟲蟯螻企 True
M.F.C(A, C) = A, C 螻牛旧蟲 (Mutual Friend Count)
A 豢豌豺蟲 讌 = F(A, B) 願 F(B, C) Cれ 讌
螳螳 C襷 M.F.C(A, C)螳 朱
豺蟲1 伎
Third
螳蠍語企 豺蟲2 讌ル襭
豺蟲3 ル
Jilin Chen, (2009), Recommending People on Social Networking Sites.
13
14. Close Friend of a Close Friend (CFOACF) 豢豌
FOAF 豢豌 螻襴讀 豺覦襯 豢螳 螻襴讀
A 豢豌豺蟲 讌 = F(A, B) 願 F(B, C) Cれ 讌
I(A, B) = A B 豺覦 (A B襦 給 豺襦 )
Score of C = I(A, Bi) * I(Bi, C)
2
9
1
豺蟲1 1 伎
1
5
螳蠍語企 豺蟲2 讌ル襭
2
豺蟲3 ル
14
15. Close Friend of a Close Friend (CFOACF) 豢豌
FOAF 豢豌 螻襴讀 豺覦襯 豢螳 螻襴讀
A 豢豌豺蟲 讌 = F(A, B) 願 F(B, C) Cれ 讌
I(A, B) = A B 豺覦 (A B襦 給 豺襦 )
Score of C = I(A, Bi) * I(Bi, C)
豺蟲1 伎
5
螳蠍語企 豺蟲2 2 讌ル襭
2
16
3
豺蟲3 ル
15
16. Close Friend of a Close Friend (CFOACF) 豢豌
FOAF 豢豌 螻襴讀 豺覦襯 豢螳 螻襴讀
A 豢豌豺蟲 讌 = F(A, B) 願 F(B, C) Cれ 讌
I(A, B) = A B 豺覦 (A B襦 給 豺襦 )
Score of C = I(A, Bi) * I(Bi, C)
豺蟲1 伎
5 4 20
螳蠍語企 豺蟲2 讌ル襭
豺蟲3 ル
16
17. Close Friend of a Close Friend (CFOACF) 豢豌
豺覦 螳 一 襦語
蟯豺蟲, 蠍,
覩誤, 豺蟲 襷碕 蠍郁
Feedback !!
17
37. 谿瑚覓誤
Jilin Chen, (2009), Recommending People on Social Networking Sites.
Robin Dunbar, (2010), How Many friends Does One Person Need.
RENZO ANGLES, (2008), Survey of Graph database models, ACM
Computing Surveys.
Marko A. Rodriguez, (2010), Graph Traversal Programming Pattern.
HANNEMAN, R. A, (2001), Introduction to social network methods.
TinkerPop, TinkerGraph.
http://github.com/tinkerpop/gremlin/wiki/tinkergraph
Grzegorz Malewicz, (2010), Pregel : A System for Large-Scale Graph
Processing, Google, Inc.
Microsoft, Trinity, http://research.microsoft.com/en-us/projects/trinity/
37
38. 谿瑚覓誤
Neo Technology, Neo4j : the Graph database. www.neo4j.org
Twitter, FlockDB,
https://github.com/twitter/flockdb/blob/master/doc/blog.md
Orient Technologies, OrientDB, http://www.orientechnologies.com/
Marko A. Rodriguez, MySQL vs. Neo4j on a Large-Scale Graph Traversal,
http://markorodriguez.com/2011/02/18/mysql-vs-neo4j-on-a-large-scale-
graph-traversal/
38