511 search results - page 48 / 103 » Approximate Selection Queries over Imprecise Data |
171
click to vote
MP
2010
15 years 4 months ago
2010
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
183
click to vote
SIGMOD
1995
ACM
15 years 9 months ago
1995
ACM
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
162
click to vote
DEXA
2005
Springer
15 years 11 months ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
248
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
169
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...