In late May, 2008, a group of database researchers, architects, users and pundits met at the Claremont Resort in Berkeley, California to discuss the state of the research field an...
Rakesh Agrawal, Anastasia Ailamaki, Philip A. Bern...
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...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Drawing inspiration from several previous projects, we present an ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusua...
Luke Dalessandro, Michael F. Spear, Michael L. Sco...
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...