1038 search results - page 127 / 208 » Space-Bounded Query Approximation |
150
click to vote
SSDBM
2008
IEEE
15 years 10 months ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
212
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
167
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
146
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
139
click to vote
WAW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...