Sciweavers

736 search results - page 33 / 148
» Answering Imprecise Queries over Web Databases
Sort
View
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
12 years 11 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
SIGMOD
1998
ACM
121views Database» more  SIGMOD 1998»
13 years 12 months ago
New Sampling-Based Summary Statistics for Improving Approximate Query Answers
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
Phillip B. Gibbons, Yossi Matias
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
14 years 9 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
ICDE
2007
IEEE
169views Database» more  ICDE 2007»
14 years 2 months ago
Aggregate Query Answering on Anonymized Tables
Privacy is a serious concern when microdata need to be released for ad hoc analyses. The privacy goals of existing privacy protection approaches (e.g., -anonymity and -diversity) ...
Qing Zhang, Nick Koudas, Divesh Srivastava, Ting Y...
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Table Anonymization for Aggregate Query Answering
Abstract-- Privacy protection is a major concern when microdata needs to be released for ad hoc analyses. This has led to a lot of recent research in privacy goals and table anonym...
Cecilia M. Procopiuc, Divesh Srivastava