The Community for Technology Leaders
2008 IEEE 24th International Conference on Data Engineering (2008)
Cancun, Mexico
Apr. 7, 2008 to Apr. 12, 2008
ISBN: 978-1-4244-1836-7
pp: 1043-1052
Shetal Shah , Indian Institute of Technology Bombay, India. shetals@cse.iitb.ac.in
Krithi Ramamritham , Indian Institute of Technology Bombay, India. krithi@cse.iitb.ac.in
ABSTRACT
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as polynomials over multiple data items. Given a set of polynomial queries at a coordinator C, and a user-specified accuracy bound (tolerable imprecision) for each query, we address the problem of assigning data accuracy bounds or filters to the source of each data item. Assigning data accuracy bounds for non-linear queries poses special challenges. Unlike linear queries, data accuracy bounds for non-linear queries depend on the current values of data items and hence need to be recomputed frequently. So, we seek an assignment such that a) if the value of each data item at C is within its data accuracy bound then the value of each query is also within its accuracy bound, b) the number of data refreshes sent by sources to C to meet the query accuracy bounds, is as low as possible, and c) the number of times the data accuracy bounds need to be recomputed is as low as possible. In this paper, we couple novel ideas with existing optimization techniques to derive such an assignment.
INDEX TERMS
CITATION

S. Shah and K. Ramamritham, "Handling Non-linear Polynomial Queries over Dynamic Data," 2008 IEEE 24th International Conference on Data Engineering(ICDE), Cancun, Mexico, 2008, pp. 1043-1052.
doi:10.1109/ICDE.2008.4497513
96 ms
(Ver 3.3 (11022016))