17329 search results - page 3205 / 3466 » Improved non-approximability results |
189
Voted
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to im...
161
Voted
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...
202
Voted
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
160
click to vote
SIGMOD
2002
ACM
16 years 6 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...
163
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...