Mosaic: processing a trillion-edge graph on a single machine | the morning paper
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Mosaic: Processing a trillion-edge graph on a single machine Maass et al., EuroSys’17 Unless your graph is bigger than Facebook’s, you can process it on a single machine. With the inception of the internet, large-scale graphs comprising web graphs or social networks have become co
Apache TinkerPop: Home
Gremlin Query Language Gremlin is the graph traversal language of Apache TinkerPop. Gremlin is a functional, data-flow language that enables users to succinctly express complex traversals on (or queries of) their application's property graph. Every Gremlin traversal is composed of a sequence of (potentially nested) steps.
「パナマ文書ã€è§£æžã®æŠ€è¡“çš„å´é¢
世界ä¸ã§è©±é¡Œã«ãªã£ã¦ã„るパナマ文書。å„国ã§æ”¿æ¨©ã‚’æºã‚‹ãŒã™ã‚ˆã†ãªäº‹æ…‹ã«ã‚‚ãªã£ã¦ã„ã¾ã™ãŒã€ç´”粋ã«ãƒ‡ãƒ¼ã‚¿ã¨ã—ã¦ã¿ãŸå ´åˆã€ã“ã‚Œã¯è¨ˆç®—機やデータ解æžã«é–¢ã‚る人々ã«ã‚‚é¢ç™½ã„ã‚‚ã®ã ã¨æ€ã„ã¾ã™ã€‚データã®ä¸èº«ã‚„背景ãªã©ã«ã¤ã„ã¦ã¯ã•ã‚“ã–ã‚“å ±é“ã•ã‚Œã¦ã„ã¾ã™ã®ã§ã“ã“ã§ã¯è§¦ã‚Œã¾ã›ã‚“。一方ã€ç¾å ´ã§ã©ã®ã‚ˆã†ãªä½œæ¥ãŒè¡Œã‚ã‚Œã¦ã„ã‚‹ã®ã‹ã¯ã‚ã¾ã‚Šå ±é“ã•ã‚Œã¦ã„ã¾ã›ã‚“。ç¾å®Ÿçš„ãªå•é¡Œã¨ã—ã¦ã€äººåŠ›ã§ã¯ã©ã†ã—よã†ã‚‚ãªã„é‡ã®ãƒªãƒ¼ã‚¯ãƒ‡ãƒ¼ã‚¿ã‚’手ã«å…¥ã‚ŒãŸå ´åˆã€èª¿æŸ»å ±é“æ©Ÿé–¢ã¯ã©ã‚“ãªã“ã¨ã‚’è¡Œã£ã¦ã„ã‚‹ã®ã§ã—ょã†ã‹ï¼Ÿç§ã‚‚以å‰ã‹ã‚‰ç–‘å•ã«æ€ã£ã¦ã„ãŸã®ã§ã™ãŒã€å…ˆæ—¥ã‚るデータベースä¼æ¥ã¨ã€ãƒ‡ãƒ¼ã‚¿åˆ†æžã‚¢ãƒ—リケーションを作æˆã™ã‚‹ä¼šç¤¾ã®ãƒ–ãƒã‚°ã«ã¦ã€ãã®å®Ÿéš›ã®ä¸€ç«¯ã‚’窺ã†ã“ã¨ãŒã§ãる投稿ãŒã‚ã‚Šã¾ã—ãŸ: Panama Papers: How Linkurious enables ICIJ to investigate the massive Mossack Fonseca
ウェブã§ã‹ã£ã“ã„ã„グラフをæããŸã‚ã®ãƒ©ã‚¤ãƒ–ラリやらテクニックやらã®ã¾ã¨ã‚ - IDEA*IDEA ～ 百å¼ç®¡ç†äººã®ãƒ©ã‚¤ãƒ•ãƒãƒƒã‚¯ãƒ–ãƒã‚° ～
ドットインストール代表ã®ãƒ©ã‚¤ãƒ•ãƒãƒƒã‚¯ãƒ–ãƒã‚°
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GitHub - rdf-elixir/rdf-ex: An implementation of RDF for Elixir
{{#tags}}- {{label}}
{{/tags}}