11211 search results - page 1788 / 2243 » Rank-Sensitive Data Structures |
144
click to vote
OSDI
2004
ACM
16 years 5 months ago
2004
ACM
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
249
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
162
Voted
SIGMOD
2003
ACM
16 years 5 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...
139
click to vote
SIGMOD
2002
ACM
16 years 5 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
262
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...