525 search results - page 81 / 105 » On Query Algebras for Probabilistic Databases |
127
Voted
PODS
1998
ACM
15 years 3 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
113
click to vote
BIOCOMP
2007
15 years 1 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
116
Voted
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract— Developing a full-fledged cost-based XQuery optimizer is a fairly complex task. Nowadays, there is little knowledge concerning suitable cost formulae and optimization ...
VLDB
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important...
SUM
2009
Springer
15 years 4 months ago
2009
Springer
Database techniques to store, query and manipulate data that contains uncertainty receives increasing research interest. Such UDBMSs can be classified according to their underlyin...