摘要
Thispaperproposesasemi-greedyframeworkforoptimizingmulti-joinqueriesinshared-nothingsystems.Theplangeneratedbytheframeworkcomprisesseveralpipelines,eachperformingseveraljoins.Theframeworkdeterminesthe“optimal”numberofjoinstobeperformedineachpipeline.Thedecisionsaremadebasedonthecostestimationoftheentireprocessingplan.Twoexistingoptimizationalgorithmsareextendedundertheframework.Ananalyticalmodelispresentedandusedtocomparethequalityofplansproducedbyeachoptimizationalgorithm.Ourstudyshowsthatthenewalgorithmsoutperformtheircounterpartsthatarenotextended.
出版日期
1995年02月12日(中国期刊网平台首次上网日期,不代表论文的发表时间)