Please use this identifier to cite or link to this item:
|Authors:||Wu, S. |
|Citation:||Wu, S.,Ooi, B.C.,Tan, K.-L. (2013). Online Aggregation. Intelligent Systems Reference Library 36 : 187-210. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-28323-9_8|
|Abstract:||In this chapter, we introduce a new promising technique for query processing, online aggregation. Online aggregation is proposed based on the assumption that for some applications, the precise results are not always required. Instead, the approximate results can provide a good enough estimation. Compared to the precise results, computing the approximate ones are more cost effective, especially for large-scale datasets. To generate the approximate result, online aggregation retrieves samples continuously from the database. The samples are streamed to the query engine for processing the query. The accuracy of the approximate result is described by a statistical model. Normally, the result is refined as more samples are obtained. The user can terminate the processing at any time, when he/she is satisfied with the quality of the result. The performance of online aggregation relies on the sampling approach and estimation model. In this chapter, our discussion is focused on these two components. Besides introducing the basic principles of online aggregation, we also review some new applications built on top of it. We complete the chapter by discussing the challenges of online aggregation and some future directions. © Springer-Verlag Berlin Heidelberg 2013.|
|Source Title:||Intelligent Systems Reference Library|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 10, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.