Approximate Range Querying over Sliding Windows

Approximate Range Querying over Sliding Windows

Francesco Buccafurri (University “Mediterranea” of Reggio Calabria, Italy), Gianluca Caminiti (University “Mediterranea” of Reggio Calabria, Italy) and Gianluca Lax (University “Mediterranea” of Reggio Calabria, Italy)
DOI: 10.4018/978-1-60566-058-5.ch121
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

In the context of Knowledge Discovery in Databases, data reduction is a pre-processing step delivering succinct yet meaningful data to sequent stages. If the target of mining are data streams, then it is crucial to suitably reduce them, since often analyses on such data require multiple scans. In this chapter, we propose a histogram-based approach to reducing sliding windows supporting approximate arbitrary (i.e., non biased) range-sum queries. The histogram is based on a hierarchical structure (as opposed to the flat structure of traditional ones) and it results suitable to directly support hierarchical queries, such as drill-down and roll-up operations. In particular, both sliding window shifting and quick query answering operations are logarithmic in the sliding window size. Experimental analysis shows the superiority of our method in terms of accuracy w.r.t. the state-of-the-art approaches in the context of histogram-based sliding window reduction techniques.

Complete Chapter List

Search this Book:
Reset