“Inalmosteverycomputationagreatvarietyofarrangementsforthes">
Dive Into Catalyst

Dive Into Catalyst

ID:39507529

大小:3.44 MB

頁數(shù):83頁

時(shí)間:2019-07-04

Dive Into Catalyst_第1頁
Dive Into Catalyst_第2頁
Dive Into Catalyst_第3頁
Dive Into Catalyst_第4頁
Dive Into Catalyst_第5頁
資源描述:

《Dive Into Catalyst》由會員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫

1、DiveIntoCatalystQConBeijing2015ChengLian“Inalmosteverycomputationagreatvarietyofarrangementsforthesuccessionoftheprocessesispossible,andvariousconsiderationsmustinfluencetheselectionamongstthemforthepurposesofaCalculatingEngine.Oneessentialobjectistochoo

2、sethatarrangementwhichshalltendtoreducetoaminimumthetimenecessaryforcompletingthecalculation.”AdaLovelace,1843WhatIsCatalyst?Catalystisafunctional,extensiblequeryoptimizerusedbySparkSQL.-LeveragesadvancedFPlanguage(Scala)features-Containsalibraryforrepresentingtreesandapplyi

3、ngrulesonthemTreesTreeisthemaindatastructureusedinCatalyst-Atreeiscomposedofnodeobjects-Anodehasanodetypeandzeroormorechildren-NodetypesaredefinedinScalaassubclassesoftheTreeNodeclassTreesExamples-Literal(value:Int)-Attribute(name:String)-Add(left:TreeNode,right:TreeNode)Add

4、(Attribute(x),Add(Literal(1),Literal(2)))RulesRulesarefunctionsthattransformtrees-Typicallyfunctional-Leveragepatternmatching-Usedtogetherwith-TreeNode.transform(synonymoftransformDown)-TreeNode.transformDown(pre-ordertraversal)-TreeNode.transformUp(post-ordertraversal)Rules

5、Examples-Simpleconstantfoldingtree.transform{caseAdd(Literal(c1),Literal(c2))=>Literal(c1+c2)caseAdd(left,Literal(0))=>leftcaseAdd(Literal(0),right)=>right}RulesExamples-Simpleconstantfoldingtree.transform{caseAdd(Literal(c1),Literal(c2))=>Literal(c1+c2)caseAdd(left,Literal(

6、0))=>leftcaseAdd(Literal(0),right)=>right}PatternRulesExamples-Simpleconstantfoldingtree.transform{caseAdd(Literal(c1),Literal(c2))=>Literal(c1+c2)caseAdd(left,Literal(0))=>leftcaseAdd(Literal(0),right)=>right}TransformationRulesExamples-Simpleconstantfoldingtree.transform{c

7、aseAdd(Literal(c1),Literal(c2))=>Literal(c1+c2)caseAdd(left,Literal(0))=>leftcaseAdd(Literal(0),right)=>right}RuleBrainsuckBrainsuckisanoptimizingcompileroftheBrainfuckprogramminglanguageBrainsuckBrainsuckisanoptimizingcompileroftheBrainfuckprogramminglanguage-Yeah,it’snotat

8、ypo,justwannaavoidsayingdirtywordsallthetimeduringthetalk:^)BrainsuckBrains

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動(dòng)畫的文件,查看預(yù)覽時(shí)可能會顯示錯(cuò)亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫負(fù)責(zé)整理代發(fā)布。如果您對本文檔版權(quán)有爭議請及時(shí)聯(lián)系客服。
3. 下載前請仔細(xì)閱讀文檔內(nèi)容,確認(rèn)文檔內(nèi)容符合您的需求后進(jìn)行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時(shí)可能由于網(wǎng)絡(luò)波動(dòng)等原因無法下載或下載錯(cuò)誤,付費(fèi)完成后未能成功下載的用戶請聯(lián)系客服處理。