A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Study of scalable declustering algorithms for parallel grid files
Proceedings of International Conference on Parallel Processing
Efficient storage and retrieval of large multidimensional datasets is an important concern for large-scale scientific computations such as long-running time-dependent simulations which periodically generate snapshots of the state. The main challenge for efficiently handling such datasets is to minimize response time for multidimensional range queries. The grid file is one of the well known access methods for multidimensional and spatial data. We investigate effective and scalable declustering
doi:10.1109/ipps.1996.508092
dblp:conf/ipps/MoonAS96
fatcat:dw2avssj3rg73jg5ohidpjq6m4