Algorithm 3 DSAT under w-event privacy
Input:
D = {Di|1 ≤ i ≤ N, i ∈ Z}, T, C and ε.
Output:
D̃ = {D̃i|1 ≤ i < N, i ∈ Z}
1:	Run DSAT for the first w time points;
2:	for i = (w + 1) to N do
3:	${\epsilon }_{rm}={\in }_2-{\sum }_{m=i-w+1}^{m=i-1}{\epsilon }_{2,m}$
4:	if εrm ≤ 0 then
5:	Set D̃i := Dj, where j is the time point of last release;
6:	else
7:	Set $\mathit{\text{count}}=\frac{{\sum }_{m=i-w+1}^{m=i-1}{\epsilon }_{2,m}}{{\epsilon }_2/C}$
8:	Compute $\stackrel{\sim }{d}(D_i,{\stackrel{\sim }{D}}_j)=d(D_i,{\stackrel{\sim }{D}}_j)+\mathit{\text{Lap}}(\frac{2C\mathrm{\Delta }}{{\epsilon }_1})$;
9:	Compute $E_i=|\frac{\mathit{\text{count}}}{i}-\frac{C}{w}|,e_i=\frac{|E_i-\delta |}{\delta }$, and ui = θ × ei;
10:	if $\frac{\mathit{\text{count}}}{i}-\frac{C}{w}\le 0$, then T̃i = max{0, Ti−1 − ui};
11:	else set T̃i = min{2, Ti−1 + ui};
12:	if d̃(Di, D̃j) ≥ T̃i, then set ε2,i = ε2/C, D̃i := Di+ < Lap(1/ε2,i) >U, and j = i;
13:	else set D̃i := Dj;
14:	end if
15:	end for