We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
We present a novel sensor network query processing architecture that (a) covers all the query optimization phases that are required to map a declarative query to executable code; ...
Ixent Galpin, Christian Y. A. Brenninkmeijer, Farh...
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the obj...
Reynold Cheng, Ben Kao, Sunil Prabhakar, Alan Kwan...
Wireless sensor networks consist of nodes with the ability to measure, store, and process data, as well as to communicate wirelessly with nodes located in their wireless range. Us...