Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
A distributed system for approximate query answering on sensor network data is proposed, where a suitable compression technique is exploited to represent data and support query an...
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...