AN EFFICIENT ALGORITHM TO COMPUTE MAX/MIN VALUES IN SLIDING WINDOW FOR DATA STREAMS

Ying Sha, Jianlong Tan

Abstract

With the development of Internet, more and more data-stream based applications emerged, where calculation of aggregate functions plays an important role. Many studies were conducted on aggregation functions; however, an efficient algorithm to calculate Max/Min values remains an open problem. Here, we propose a novel, exact method to computer Max/Min values for the numerical input data. Employing an incrementally calculating strategy on sliding windows, this algorithm gains a high efficiency. We analyze the algorithm and prove the time-complexity and space-complexity in worst cases. Experimental results confirm its high performance on a testing dataset.

References

  1. Cormode, G. and S.Muthukrishnan (2003). What's hot and what's not: Tracking most frequent items dynamically. ACM Principles of Database Systems(PDOS), pages 296-306.
  2. Cortes, C., Fisher, K., Pregibon, D., Rogers, A., and Smith, F. (2000). Hancock: A language for extracting signatures from data streams. Proc. Sixth Int'l Conf. Knowledge Discovery and Data Mining, pages 9-17.
  3. Dani, A. and Getta, J. (2005). Conceptual modeling of computations on data streams. Conferences in Research and Practice in Information Technology Series, 107:43-47.
  4. Dobra, A., Gehrke, J., Garofalakis, M., and Rastogi, R. (2002). Processing complex aggregate queries over data streams. pages 61-72.
  5. Gilbert, A., Kotidis, Y., Muthukrishnan, S., and Strauss, M. (2001). Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. Proc. 27th Int'l Conf. Very Large Data Bases, pages 79-88.
  6. Guha, S., Koudas, N., and Shim, K. (2001). Data-streams and histograms. Annual ACM Symposium on Theory of Computing, pages 471-475.
  7. Henzinger, M. R., Raghavan, P., and Rajagopalan, S. (1998). Computing on data streams. Technical report TR 1998-011, Compaq Systems Research Center, Palo Alto, CA,.
Download


Paper Citation


in Harvard Style

Sha Y. and Tan J. (2007). AN EFFICIENT ALGORITHM TO COMPUTE MAX/MIN VALUES IN SLIDING WINDOW FOR DATA STREAMS . In Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT, ISBN 978-989-8111-07-4, pages 123-128. DOI: 10.5220/0001338101230128


in Bibtex Style

@conference{icsoft07,
author={Ying Sha and Jianlong Tan},
title={AN EFFICIENT ALGORITHM TO COMPUTE MAX/MIN VALUES IN SLIDING WINDOW FOR DATA STREAMS},
booktitle={Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT,},
year={2007},
pages={123-128},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001338101230128},
isbn={978-989-8111-07-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT,
TI - AN EFFICIENT ALGORITHM TO COMPUTE MAX/MIN VALUES IN SLIDING WINDOW FOR DATA STREAMS
SN - 978-989-8111-07-4
AU - Sha Y.
AU - Tan J.
PY - 2007
SP - 123
EP - 128
DO - 10.5220/0001338101230128