2514 search results - page 259 / 503 » On the Computation of Approximations of Database Queries |
170
click to vote
KES
2010
Springer
15 years 5 months ago
2010
Springer
While computation of biological information takes center stage in today’s research, knowledge-based query processing in biological databases has not gained much attention. The co...
190
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
214
click to vote
PODS
1998
ACM
15 years 11 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 ...
190
click to vote
CBMS
2006
IEEE
16 years 23 days ago
2006
IEEE
— Most biomedical research databases contain considerable amounts of time-oriented data. However, temporal knowledge about the contextual meaning of such data is not usually repr...
141
click to vote
VLDB
2005
ACM
16 years 5 days ago
2005
ACM
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS...