def __init__(self, data, param):
HT_standard.__init__(self, data, param)
self.split_eps = self.param.Eps * self.param.PercentSplit / 2
budget_x = self.split_eps / self.maxSplit[1]
budget_y = self.split_eps / self.maxSplit[1]
_data = data
_idx = np.argsort(_data[0, :], kind='mergesort')
_data[:, :] = _data[:, _idx] # sorted by x
split_no_x = self.getRecursiveMediansNo(_data[0, :], budget_x)
_idx = np.argsort(_data[1, :], kind='mergesort')
_data[:, :] = _data[:, _idx] # sorted by x
split_no_y = self.getRecursiveMediansNo(_data[1, :], budget_y)
self.split_no = [split_no_x, split_no_y]
print self.split_no
def __init__(self, data, param):
HT_standard.__init__(self, data, param)
self.split_eps = self.param.Eps * self.param.PercentSplit / 2
budget_x = self.split_eps / self.maxSplit[1]
budget_y = self.split_eps / self.maxSplit[1]
_data = data
_idx = np.argsort(_data[0, :], kind='mergesort')
_data[:, :] = _data[:, _idx] # sorted by x
split_no_x = self.getRecursiveMediansNo(_data[0, :], budget_x)
_idx = np.argsort(_data[1, :], kind='mergesort')
_data[:, :] = _data[:, _idx] # sorted by x
split_no_y = self.getRecursiveMediansNo(_data[1, :], budget_y)
self.split_no = [split_no_x, split_no_y]
print self.split_no
def run_HT_standard(self, param):
logging.debug('building HT_standard...')
tree = HT_standard(self.data, param)
start = time.clock()
tree.buildIndex()
if Params.CONSTRAINT_INFERENCE:
tree.adjustConsistency()
end = time.clock()
logging.info('[T] HT_standard building time: %.2d ' % (end - start))
return self.query(tree, "HT_standard")
def __init__(self, data, param):
HT_standard.__init__(self, data, param)
def __init__(self, data, param):
HT_standard.__init__(self, data, param)
self.param.maxHeightHTree = 4
def __init__(self, data, param):
HT_standard.__init__(self, data, param)
def __init__(self, data, param):
HT_standard.__init__(self, data, param)
self.param.maxHeightHTree = 4
self.gridBudget = 0
