Mining and Predicting Duplication over Peer-to-Peer Query Streams

  • Authors:

  • Shicong Meng;Yifeng Shao;Cong Shi;Dingyi Han;Yong Yu

  • Affiliations:

  • Shanghai Jiao Tong University, Shanghai, 200030, P.R.China.;Shanghai Jiao Tong University, Shanghai, 200030, P.R.China.;Shanghai Jiao Tong University, Shanghai, 200030, P.R.China.;Shanghai Jiao Tong University, Shanghai, 200030, P.R.China.;Shanghai Jiao Tong University, Shanghai, 200030, P.R.China.

  • Venue:
  • ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models(Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction.