511 search results - page 28 / 103 » Approximate Selection Queries over Imprecise Data |
199
click to vote
PODS
2006
ACM
16 years 6 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 ...
158
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
161
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
156
click to vote
ADC
2007
Springer
16 years 5 days ago
2007
Springer
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
152
click to vote
TKDE
2010
15 years 4 months ago
2010
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...