@Article{cmc.2019.03744, AUTHOR = {Lan Sun, Chen Ge, Xin Huang, Yingjie Wu, Yan Gao}, TITLE = {Differentially Private Real-Time Streaming Data Publication Based on Sliding Window Under Exponential Decay}, JOURNAL = {Computers, Materials \& Continua}, VOLUME = {58}, YEAR = {2019}, NUMBER = {1}, PAGES = {61--78}, URL = {http://www.techscience.com/cmc/v58n1/22996}, ISSN = {1546-2226}, ABSTRACT = {Continuous response of range query on steaming data provides useful information for many practical applications as well as the risk of privacy disclosure. The existing research on differential privacy streaming data publication mostly pay close attention to boosting query accuracy, but pay less attention to query efficiency, and ignore the effect of timeliness on data weight. In this paper, we propose an effective algorithm of differential privacy streaming data publication under exponential decay mode. Firstly, by introducing the Fenwick tree to divide and reorganize data items in the stream, we achieve a constant time complexity for inserting a new item and getting the prefix sum. Meanwhile, we achieve time complicity linear to the number of data item for building a tree. After that, we use the advantage of matrix mechanism to deal with relevant queries and reduce the global sensitivity. In addition, we choose proper diagonal matrix further improve the range query accuracy. Finally, considering about exponential decay, every data item is weighted by the decay factor. By putting the Fenwick tree and matrix optimization together, we present complete algorithm for differentiate private real-time streaming data publication. The experiment is designed to compare the algorithm in this paper with similar algorithms for streaming data release in exponential decay. Experimental results show that the algorithm in this paper effectively improve the query efficiency while ensuring the quality of the query.}, DOI = {10.32604/cmc.2019.03744} }