630 search results - page 46 / 126 » Optimized union of non-disjoint distributed data sets |
JOCN
2010
14 years 8 months ago
2010
■ Free recall is a fundamental paradigm for studying memory retrieval in the context of minimal cue support. Accordingly, free recall has been extensively studied using behavior...
174
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
The advent of new parallel architectures has increased the need for parallel optimizing compilers to assist developers in creating efficient code. OpenUH is a state-of-the-art opt...
ICDE
2007
IEEE
15 years 4 months ago
2007
IEEE
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...