A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Answering ad hoc aggregate queries from data streams using prefix aggregate trees
2006
Knowledge and Information Systems
In some business applications such as trading management in financial institutions, it is required to accurately answer ad hoc aggregate queries over data streams. Materializing and incrementally maintaining a full data cube or even its compression or approximation over a data stream is often computationally prohibitive. On the other hand, although previous studies proposed approximate methods for continuous aggregate queries, they cannot provide accurate answers. In this paper, we develop a
doi:10.1007/s10115-006-0024-8
fatcat:em44c34l3nhk7eunit2dp2addi