![pgx貧でのコンパイルとg佩
pgx> p = session.compileProgram(＾hello.gm￣)
==> CompiledProgram[name=hello_world]
pgx> p.run()
==> { <- (2.2.1だとRemote modeだとprintが咾ません。)
"success" : true,
"canceled" : false,
"exception" : null,
"returnValue" : null,
"executionTimeMs" : 6
}
pgx>](https://image.slidesharecdn.com/pgx1-161222034411/85/Green-Marl-7-320.jpg)
More Related Content
Similar to 赫姻艶艶稼-珂温姻鉛を聞った嶄伉來峺炎プログラミング (20)
赫姻艶艶稼-珂温姻鉛を聞った嶄伉來峺炎プログラミング
- 1. Green-Marlを聞った 嶄伉來峺縫廛蹈哀薀潺鵐 kh PGX ユ`ザ`茶氏 #1 12/20 オラクル楳表センタ` 22F カフェ
- 3. Green-Marlとは ? A key benefit of PGX is that you may implement algorithms with no limit. You can easily add your own algorithms using Green-Marl, a domain-specific language designed for graph algorithms. https://docs.oracle.com/cd/E56133_01/2.2.1/tutorials/compile.html ? G. Malewicz et al, "Pregel: A System for Large Scale Graph Processing", SIGMOD 2010. ? DSL for graph (data analysis). Spark GraphX ? The Green-Marl Language Specification (June 18, 2015)
- 4. S Hong, H Chafi, E Sedlar, K Olukotun - ACM SIGARCH Computer Architecture News, 2012
- 5. 1 Introduction 1.1 The Green-Marl Language and its Purpose
- 6. インスト`ルとHello World ? h廠 ? https://github.com/stanford-ppl/Green-Marl ? pgx-2.2.1 ? java 1.8.0_112 ? CenOS 7.3 procedure hello_world() { println("Hello worldn"); } hello.gm
- 7. pgx貧でのコンパイルとg佩 pgx> p = session.compileProgram(＾hello.gm￣) ==> CompiledProgram[name=hello_world] pgx> p.run() ==> { <- (2.2.1だとRemote modeだとprintが咾ません。) "success" : true, "canceled" : false, "exception" : null, "returnValue" : null, "executionTimeMs" : 6 } pgx>
- 8. ┠翌乙馨喝界看馨沿庄鉛艶
- 9. 箪初嶄伉來
- 11. TODO ? Focus Centrality のg廾 ? 5 Parallel Execution and Consistency
Editor's Notes
- #4: インスパイア