1192 search results - page 83 / 239 » Subject Index |
168
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
159
click to vote
ANCS
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we present an exact active statistics counter architecture called BRICK (Bucketized Rank Indexed Counters) that can efficiently store per-flow variable-width statis...
166
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
175
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
The performance of a database system depends strongly on the layout of database objects, such as indexes or tables, onto the underlying storage devices. A good layout will both ba...
CORR
2010
Springer
15 years 6 months ago
2010
Springer
With the help of index functions, we re-derive the ML(n)BiCGStab algorithm in [35] in a more systematic way. There are n ways to define the ML(n)BiCGStab residual vector. Each diff...