3134 search results - page 452 / 627 » Computing full disjunctions |
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
SIGMOD
2002
ACM
14 years 10 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
PODS
2005
ACM
14 years 10 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
PODS
2008
ACM
14 years 10 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
MOBISYS
2007
ACM
14 years 10 months ago
2007
ACM
The NEMO project is exploring the use of mobile sensor nodes to augment physical work artefacts in order to ensure compliance with health and safety regulations. In this paper we ...