-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathgrid_generate.py
More file actions
207 lines (170 loc) · 9.61 KB
/
Copy pathgrid_generate.py
File metadata and controls
207 lines (170 loc) · 9.61 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
import consistency_method as ConMeth
class GridCell:
def __init__(self, dimension_num = None, level = 0, cell_index = None):
assert dimension_num != None
self.dimension_num = dimension_num
self.left_interval_list = [-1 for i in range(dimension_num)] # x_1, y_1, z_1
self.right_interval_list = [-1 for i in range(dimension_num)] # x_2, y_2, z_2
self.cell_index = cell_index
self.dimension_index_list = None # for overall consistency
self.level = level
self.next_level_grid = None
self.real_count = 0
self.perturbed_count = 0
self.consistent_count = 0
class UniformGrid:
def __init__(self, attribute_set = None, granularity = None, left_interval_list = None, right_interval_list = None, args = None):
self.args = args
self.attribute_set = attribute_set
self.dimension_num = len(attribute_set)
self.Grid_index = None
if granularity is None:
granularity = self.args.domain_size
if left_interval_list is None:
self.left_interval_list = [0 for i in range(self.dimension_num)]
else:
self.left_interval_list = left_interval_list
if right_interval_list is None:
self.right_interval_list = [(self.args.domain_size - 1) for i in range(self.dimension_num)]
else:
self.right_interval_list = right_interval_list
self.granularity = granularity
self.cell_unit_length_list = []
self.cell_list = []
self.weighted_update_matrix = []
def Main(self): # construct the grid
self.generate_grid()
def get_consistent_grid(self):
est_value_list = [0 for i in range(len(self.cell_list))]
for i in range(len(self.cell_list)):
est_value_list[i] = self.cell_list[i].perturbed_count
consistent_value_list = ConMeth.norm_sub(est_value_list, user_num=self.args.user_num)
for i in range(len(self.cell_list)):
self.cell_list[i].consistent_count = consistent_value_list[i]
return
def get_consistent_grid_iteration(self):
est_value_list = [0 for i in range(len(self.cell_list))]
for i in range(len(self.cell_list)):
# here is the consistent_count for iteration
est_value_list[i] = self.cell_list[i].consistent_count
consistent_value_list = ConMeth.norm_sub(est_value_list, user_num= self.args.user_num)
for i in range(len(self.cell_list)):
self.cell_list[i].consistent_count = consistent_value_list[i]
return
def get_dimension_index_list_from_cell_index(self, cell_index = None):
dimension_index_list = [0 for i in range(self.dimension_num)]
tmp_num = self.dimension_num - 1
while tmp_num >= 0:
dimension_index_list[tmp_num] = cell_index // (self.granularity ** tmp_num)
cell_index = cell_index % (self.granularity ** tmp_num)
tmp_num -= 1
return dimension_index_list
def get_left_right_interval_from_dimension_index(self, dimension = None, dimension_index=None):
# dimension index denotes the index in the dimension
tmp_left_interval = dimension_index * self.cell_unit_length_list[dimension]
tmp_right_interval = tmp_left_interval + self.cell_unit_length_list[dimension] - 1
return tmp_left_interval, tmp_right_interval
def generate_grid(self):
for i in range(self.dimension_num):
tmp_cell_unit_length = (self.right_interval_list[i] - self.left_interval_list[i] + 1) // self.granularity
self.cell_unit_length_list.append(tmp_cell_unit_length)
total_cell_num = self.granularity ** self.dimension_num
for i in range (total_cell_num):
new_cell = GridCell(self.dimension_num)
new_cell.cell_index = i
tmp_dimension_index_list = self.get_dimension_index_list_from_cell_index(new_cell.cell_index)
new_cell.dimension_index_list = tmp_dimension_index_list
for j in range(self.dimension_num):
tmp_dimension_index = tmp_dimension_index_list[j]
tmp_left_interval, tmp_right_interval = self.get_left_right_interval_from_dimension_index(j, tmp_dimension_index)
new_cell.left_interval_list[j] = tmp_left_interval
new_cell.right_interval_list[j] = tmp_right_interval
self.cell_list.append(new_cell)
return
def add_real_user_record_to_grid(self, attribute_value_set : list = None):
tmp_cell_index = self.get_cell_index_from_attribute_value_set(attribute_value_set)
self.cell_list[tmp_cell_index].real_count += 1
def add_perturbed_user_record_to_grid(self, attribute_value_set : list = None):
tmp_cell_index = self.get_cell_index_from_attribute_value_set(attribute_value_set)
self.cell_list[tmp_cell_index].perturbed_count += 1
def get_cell_index_from_attribute_value_set(self, attribute_value_set : list = None):
tmp_dimension_index_list = [-1 for i in range(self.dimension_num)]
for i in range(self.dimension_num):
tmp_dimension_index_list[i] = attribute_value_set[i] // self.cell_unit_length_list[i]
tmp_cell_index = 0
for i in range(self.dimension_num):
tmp_cell_index += tmp_dimension_index_list[i] * (self.granularity ** i)
return tmp_cell_index
def get_answer_range_query_of_cell(self, cell:GridCell = None, range_query_node_list: list = None, private_flag = 0):
query_left_interval_list = []
query_right_interval_list = []
for i in range(len(range_query_node_list)):
query_left_interval_list.append(range_query_node_list[i].left_interval)
query_right_interval_list.append(range_query_node_list[i].right_interval)
cell_point_counts = 1
for i in range(len(cell.left_interval_list)):
tmp_cell_length = cell.right_interval_list[i] - cell.left_interval_list[i]
cell_point_counts *= (tmp_cell_length + 1) # note here 1 must be added
overlap_point_counts = 1
for i in range(len(cell.left_interval_list)):
tmp_cell_length = cell.right_interval_list[i]-cell.left_interval_list[i]
tmp_query_length = query_right_interval_list[i] - query_left_interval_list[i]
tmp_min_interval = min(cell.left_interval_list[i], query_left_interval_list[i])
tmp_max_interval = max(cell.right_interval_list[i], query_right_interval_list[i])
tmp_overlap_length = tmp_cell_length + tmp_query_length - abs(tmp_max_interval - tmp_min_interval) + 1
if(tmp_overlap_length <= 0):
overlap_point_counts = 0
break
else:
overlap_point_counts *= tmp_overlap_length
tans = overlap_point_counts / cell_point_counts * cell.consistent_count
return tans
def get_answer_range_query_of_cell_with_weight_update_matrix(self, cell:GridCell = None, range_query_node_list: list = None):
query_left_interval_list = []
query_right_interval_list = []
for i in range(len(range_query_node_list)):
query_left_interval_list.append(range_query_node_list[i].left_interval)
query_right_interval_list.append(range_query_node_list[i].right_interval)
cell_point_counts = 1
for i in range(len(cell.left_interval_list)):
tmp_cell_length = cell.right_interval_list[i] - cell.left_interval_list[i]
cell_point_counts *= (tmp_cell_length + 1) # note here 1 must be added
overlap_point_counts = 1
for i in range(len(cell.left_interval_list)):
tmp_cell_length = cell.right_interval_list[i]-cell.left_interval_list[i]
tmp_query_length = query_right_interval_list[i] - query_left_interval_list[i]
tmp_min_interval = min(cell.left_interval_list[i], query_left_interval_list[i])
tmp_max_interval = max(cell.right_interval_list[i], query_right_interval_list[i])
tmp_overlap_length = tmp_cell_length + tmp_query_length - abs(tmp_max_interval - tmp_min_interval) + 1
if(tmp_overlap_length <= 0):
overlap_point_counts = 0
break
else:
overlap_point_counts *= tmp_overlap_length
tans = 0
if overlap_point_counts == cell_point_counts:
tans = cell.consistent_count
elif overlap_point_counts == 0:
tans = 0
else:
assert len(cell.left_interval_list) == 2
for i in range(cell.left_interval_list[0], cell.right_interval_list[0] + 1):
if query_left_interval_list[0] <= i and i <= query_right_interval_list[0]:
for j in range(cell.left_interval_list[1], cell.right_interval_list[1] + 1):
if query_left_interval_list[1] <= j and j <= query_right_interval_list[1]:
tans += self.weighted_update_matrix[i][j]
return tans
def answer_range_query(self, range_query_node_list):
assert len(self.attribute_set) == len(range_query_node_list)
ans = 0
for i in range(len(self.cell_list)):
tmp_cell = self.cell_list[i]
ans += self.get_answer_range_query_of_cell(tmp_cell, range_query_node_list)
return ans
def answer_range_query_with_weight_update_matrix(self, range_query_node_list):
assert len(self.attribute_set) == len(range_query_node_list)
ans = 0
for i in range(len(self.cell_list)):
tmp_cell = self.cell_list[i]
ans += self.get_answer_range_query_of_cell_with_weight_update_matrix(tmp_cell, range_query_node_list)
return ans