Sciweavers

14 search results - page 2 / 3
» (Almost) Optimal Parallel Block Access for Range Queries
Sort
View
PVM
2005
Springer
13 years 10 months ago
Implementing Byte-Range Locks Using MPI One-Sided Communication
We present an algorithm for implementing byte-range locks using MPI passive-target one-sided communication. This algorithm is useful in any scenario in which multiple processes of ...
Rajeev Thakur, Robert B. Ross, Robert Latham
PODS
2004
ACM
128views Database» more  PODS 2004»
14 years 5 months ago
Replicated Declustering of Spatial Data
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali S...
PVLDB
2008
81views more  PVLDB 2008»
13 years 4 months ago
Optimization of multi-domain queries on the web
Where can I attend an interesting database workshop close to a sunny beach? Who are the strongest experts on service computing based upon their recent publication record and accep...
Daniele Braga, Stefano Ceri, Florian Daniel, David...
ITCC
2005
IEEE
13 years 11 months ago
Design Theoretic Approach to Replicated Declustering
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
Ali Saman Tosun
VLDB
1993
ACM
152views Database» more  VLDB 1993»
13 years 9 months ago
Declustering Objects for Visualization
In this paper we propose a new declustering method which is particularly suitable for image and cartographic databases used for visualization. Our declustering method is based on ...
Ling Tony Chen, Doron Rotem