496 search results - page 76 / 100 » Machine models and lower bounds for query processing |
IOPADS
1997
13 years 9 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
VLDB
2004
ACM
14 years 8 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
CIKM
2004
Springer
14 years 1 months ago
2004
Springer
The goal of automatic image annotation is to automatically generate annotations for images to describe their content. In the past, statistical machine translation models have been...
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...