93 search results - page 3 / 19 » Efficient Table Anonymization for Aggregate Query Answering |
SIGMOD
2001
ACM
14 years 5 months ago
2001
ACM
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
DOLAP
2005
ACM
13 years 7 months ago
2005
ACM
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...
WWW
2011
ACM
13 years 8 days ago
2011
ACM
Recently answers for fact lookup queries have appeared on major search engines. For example, for the query {Barack Obama date of birth} Google directly shows “4 August 1961” a...
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract-- Cisco's NetFlow Collector (NFC) is a powerful example of a real-world product that supports multiple aggregate queries over a continuous stream of IP flow records. ...