This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis and Comparison of Replicated Declustering Schemes
November 2007 (vol. 18 no. 11)
pp. 1578-1591
Declustering distributes data among parallel disks to reduce retrieval cost using I/O parallelism. Many schemes were proposed for single copy declustering of spatial data. Recently, declustering using replication gained a lot of interest and several schemes with different properties were proposed. An in-depth comparison of major schemes is necessary to understand replicated declustering better. In this paper, we analyze the proposed schemes, tune some of the parameters and compare them for different query types and under different loads. We propose a three step retrieval algorithm for the compared schemes. For arbitrary queries dependent and partitioned allocation perform poorly, others perform close to each other. For range queries, they perform similarly with the exception of smaller queries in which RDA performs poorly and dependent performs well. For connected queries, partitioned allocation performs poorly and dependent performs well under light load.
Index Terms:
Declustering, parallel I/0, spatial range query, latin square
Citation:
Ali Saman Tosun, "Analysis and Comparison of Replicated Declustering Schemes," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 11, pp. 1578-1591, Nov. 2007, doi:10.1109/TPDS.2007.1082
Usage of this product signifies your acceptance of the Terms of Use.