2200 search results - page 303 / 440 » Bloch's Constant is Computable |
173
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
252
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
162
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Increasingly pervasive networks are leading towards a world where data is constantly in motion. In such a world, conventional techniques for query processing, which were developed...
142
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Managing scientific data warehouses requires constant adaptations to cope with changes in processing algorithms, computing environments, database schemas, and usage patterns. We h...
191
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...