Abstract. In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time up...
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...
For some years, data summarization techniques have been developed to handle the growth of databases. However these techniques are usually not provided with tools for enduserstoeffi...
W. Amenel Voglozin, Guillaume Raschia, Laurent Ugh...
Prior work in differential privacy has produced techniques for answering aggregate queries over sensitive data in a privacypreserving way. These techniques achieve privacy by addi...
Xiaokui Xiao, Gabriel Bender, Michael Hay, Johanne...