-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathsmooth_histogram_sum_test.go
More file actions
160 lines (132 loc) · 5.03 KB
/
smooth_histogram_sum_test.go
File metadata and controls
160 lines (132 loc) · 5.03 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
package promsketch
import (
"bufio"
"fmt"
"math"
"os"
"strconv"
"testing"
"time"
)
func TestSmoothHistogramSumCost(t *testing.T) {
readGoogleClusterData2009()
// readPowerDataset()
total_length := int64(2000000)
sliding_window_sizes := []int64{10000, 100000, 1000000, 10000000}
// sliding_window_sizes := []int64{1000000}
for test_case := 0; test_case < 5; test_case++ {
filename := "query_time/google_avg_shsum_" + strconv.Itoa(test_case) + ".txt"
fmt.Println(filename)
f, err := os.OpenFile(filename, os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0755)
if err != nil {
panic(err)
}
defer f.Close()
w := bufio.NewWriter(f)
for _, query_window_size := range sliding_window_sizes {
if query_window_size > total_length {
break
}
cost_query_interval_shsum_avg := int64(query_window_size / 100)
t1 := make([]int64, 0)
t2 := make([]int64, 0)
t1 = append(t1, query_window_size/3)
t2 = append(t2, query_window_size/3*2)
t1 = append(t1, int64(0))
t2 = append(t2, query_window_size-1)
for i := 1; i <= 10; i++ {
t1 = append(t1, query_window_size/10*int64(i-1))
t2 = append(t2, query_window_size/10*int64(i)-1)
}
start_t := t1[len(t1)-1]
for i := 1; i <= 10; i++ {
t1 = append(t1, start_t+query_window_size/10/10*int64(i-1))
t2 = append(t2, start_t+query_window_size/10/10*int64(i)-1)
}
start_t = t1[len(t1)-1]
for i := 1; i <= 10; i++ {
t1 = append(t1, start_t+query_window_size/10/10/10*int64(i-1))
t2 = append(t2, start_t+query_window_size/10/10/10*int64(i)-1)
}
fmt.Fprintln(w, "t1:", t1)
fmt.Fprintln(w, "t2:", t2)
fmt.Fprintln(w, "sliding window size:", query_window_size)
beta_input := []float64{0.5, 0.3535, 0.25, 0.177, 0.125, 0.0884, 0.0625, 0.044}
for _, beta := range beta_input {
fmt.Fprintln(w, "SHSum", beta)
query_time := make([]float64, len(t1))
total_query := make([]int64, len(t1))
gt_query_time := make([]float64, len(t1))
insert_compute := 0.0
avg_error := make([]float64, len(t1))
err2 := make([]float64, len(t1))
total_err_query := make([]float64, len(t1))
shsum := SmoothInitCount(beta, query_window_size)
for j := 0; j < len(t1); j++ {
query_time[j] = 0
total_query[j] = 0
total_err_query[j] = 0
gt_query_time[j] = 0
avg_error[j] = 0
err2[j] = 0
}
for t := int64(0); t < total_length; t++ {
start := time.Now()
shsum.Update(t, cases[0].vec[t].F)
elapsed := time.Since(start)
insert_compute += float64(elapsed.Microseconds())
if t == total_length-1 || (t >= query_window_size-1 && (t+1)%cost_query_interval_shsum_avg == 0) {
for j := range len(t1) {
start_t := t1[j] + t - query_window_size + 1
end_t := t2[j] + t - query_window_size + 1
start := time.Now()
shsum_avg := shsum.QueryT1T2IntervalAvg(t-start_t, t-end_t, t)
elapsed := time.Since(start)
query_time[j] += float64(elapsed.Microseconds())
total_query[j] += 1
start = time.Now()
values := make([]float64, 0)
for t := start_t; t <= end_t; t++ {
values = append(values, cases[0].vec[t].F)
}
gt_avg := sum(values) / float64(len(values))
elapsed1 := time.Since(start)
gt_query_time[j] += float64(elapsed1.Microseconds())
// fmt.Println(start_t, end_t, t, t2[j]-t1[j]+1, len(shsum_instance.Arr), elapsed.Microseconds(), elapsed1.Microseconds())
// fmt.Println(shsum_instance.GetMinTime(), shsum_instance.GetMaxTime())
// fmt.Fprintln(w, "shsum err:", AbsFloat64(gt_avg-shsum_avg)/gt_avg*100, "window size:", t2[j]-t1[j]+1)
err := AbsFloat64(gt_avg-shsum_avg) / gt_avg * 100
if !math.IsNaN(err) {
avg_error[j] += err
err2[j] += math.Pow(err, 2)
total_err_query[j] += 1
}
}
}
}
for j := 0; j < len(t1); j++ {
fmt.Fprintln(w, "shsum err:", avg_error[j]/float64(total_err_query[j]), "window size=", t2[j]-t1[j]+1)
stdvar := err2[j]/float64(total_err_query[j]) - math.Pow(avg_error[j]/float64(total_err_query[j]), 2)
stdvar = math.Sqrt(stdvar)
fmt.Fprintln(w, "shsum stdvar:", stdvar, "window size=", t2[j]-t1[j]+1)
}
total_query_compute := 0.0
total_query_gt_compute := 0.0
for j := 0; j < len(t1); j++ {
fmt.Fprintln(w, "shsum estimate query time=", query_time[j]/float64(total_query[j]), "us", "gt query time=", gt_query_time[j]/float64(total_query[j]), "us",
"window size=", t2[j]-t1[j]+1)
total_query_compute += query_time[j]
total_query_gt_compute += gt_query_time[j]
}
update_time := float64(insert_compute) / float64(total_length)
fmt.Fprintln(w, "shsum insert compute:", insert_compute, "us")
fmt.Fprintln(w, "shsum update time per item:", update_time, "us")
fmt.Fprintln(w, "shsum query compute:", total_query_compute, "us")
fmt.Fprintln(w, "gt query compute:", total_query_gt_compute, "us")
fmt.Fprintln(w, "shsum memory:", shsum.GetMemory(), "KB")
fmt.Fprintln(w, "gt memory:", float64(query_window_size)*8/1024, "KB")
w.Flush()
}
}
}
}