Sciweavers

511 search results - page 13 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
212
Voted
JCST
2008
175views more  JCST 2008»
15 years 5 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 9 months ago
Wavelet-Based Histograms for Selectivity Estimation
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
Yossi Matias, Jeffrey Scott Vitter, Min Wang
COMPGEOM
2004
ACM
15 years 11 months ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
SIGMOD
2001
ACM
160views Database» more  SIGMOD 2001»
16 years 5 months ago
Adaptive Precision Setting for Cached Approximate Values
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
Chris Olston, Boon Thau Loo, Jennifer Widom
EDBT
2006
ACM
136views Database» more  EDBT 2006»
16 years 5 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen