2614 search results - page 45 / 523 » Customizable Data Distribution for Shared Data Spaces |
85
Voted
HPDC
2003
IEEE
15 years 5 months ago
2003
IEEE
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
127
Voted
ASPLOS
1996
ACM
15 years 4 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
112
Voted
ICDE
2010
IEEE
16 years 9 days ago
2010
IEEE
In this paper, we describe a scheme for tolerating and recovering from mid-query faults in a distributed shared nothing database. Rather than aborting and restarting queries, our s...
86
Voted
ICDCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In today’s networked storage environment, it is common to have a hierarchy of caches where the lower levels of the hierarchy are accessed by multiple clients. This sharing can h...
173
Voted
PODS
1997
ACM
15 years 4 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...