Created
January 1, 2016 14:20
-
-
Save kumamotone/452281d6d0038554115d to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* CostEstmator | |
* JOIN順序を返す | |
*/ | |
var _ = require('lodash'); | |
var stats = [ | |
{ | |
viewname: "product", | |
columnsize: | |
{ | |
prdct: 87.35901527239571, | |
prdctlbl: 18.921187599726466, | |
value1: 2.468742876681103, | |
ptype: 67.91043138819239, | |
pdate: 16, | |
prdctft: 74.32864144062002, | |
pd: 86.95264417597447 | |
}, | |
timems: 9546, | |
rows: 424684, | |
bandwidthByteps: 1048576 | |
}, | |
{ | |
viewname: "feature", | |
columnsize: | |
{ | |
ft: 74.94419621637037, | |
ftlbl: 18.549862154197168 | |
}, | |
timems: 275, | |
rows: 10519, | |
bandwidthByteps: 1048576 | |
}, | |
{ | |
viewname: "producttype", | |
columnsize: | |
{ | |
pt: 70.67173252279635, | |
ptlbl: 18.47112462006079, | |
ptdate: 16 | |
}, | |
timems: 60, | |
rows: 329, | |
bandwidthByteps: 1048576 | |
} | |
]; | |
var leastcost = []; | |
var bestplan = []; | |
var rows = []; | |
var sel = 1/3; | |
function FindBestPlanDP(S) { | |
if (S.length === 1) { | |
return; | |
} | |
for (var i = 0; i < S.length; i++) { | |
var diff = _.difference(S,[S[i]]); | |
FindBestPlanDP([diff]); | |
// FindBestPlanDP([S[v]]); // 末端は必ず求まっているのでいらない | |
const idxdiff = JSON.stringify(diff); | |
const idxsv = JSON.stringify(S[i]); | |
const idxS = JSON.stringify(S); | |
var JOINCost = rows[idxdiff] || 0 + rows[idxsv]; | |
var cost = Math.max(leastcost[idxdiff] || 0, leastcost[idxsv]+ JOINCost); | |
if (cost < leastcost[idxS] || Infinity) { | |
leastcost[idxS] = cost; | |
bestplan[idxS] = (bestplan[idxdiff] || "").concat(" join ", (bestplan[idxS] || "")); | |
rows[idxS] = rows[idxdiff] * rows[idxsv] / 3; // TODO:V(R,Y),V(S,Y)で割る | |
} | |
} | |
}; | |
function FindBestPlan() { | |
for (var i=0; i<stats.length; i++) { | |
var v = stats[i]; | |
var setv = "["+JSON.stringify(v)+"]"; | |
rows[setv] = sel * v.rows; | |
bestplan[setv] = v.viewname; | |
var rowsize = 0; | |
for (var x in v.columnsize) { | |
rowsize += v.columnsize[x]; | |
} | |
leastcost[setv] = v.timems + (rows[setv]*rowsize)/v.bandwidthByteps; | |
} | |
FindBestPlanDP(stats); | |
console.log(bestplan["["+JSON.stringify(stats)+"]"]) | |
}; | |
FindBestPlan(); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment