This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries
September/October 2000 (vol. 12 no. 5)
pp. 763-778

Abstract—Declustering schemes enable parallel retrievals of raster-spatial data by allocating data among multiple disks. Previous work in the literature has focused on static range queries. In this paper, we focus on interactive navigation queries, which exhibit a new class of data access patterns. We analyze and compare the performance of previously known declustering schemes from the perspective of navigation queries. These schemes include a class of latin-square-based schemes, Disk Modulo, Fieldwise Exclusive-OR, Hilbert Curve Allocation Method, and a random assignment scheme. We show that, unlike the case of range queries, disk modulo outperforms other schemes and gives nearly optimal performance for navigation queries. In addition, we propose a new scheme under the constraint of bounded window size—a common constraint in practice due to resource limitation such as monitor resolution or memory size. Through extensive analysis, we establish guidelines on how these schemes can be tuned to provide guaranteed performance under the constraint of bounded window size.

[1] T. Barclay, J. Gray, and D. Slutz, “Microsoft TerraServer: A Spatial Data Warehouse,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 307–318, 2000.
[2] R. Bhatia, R.K. Sinha, and C.-M. Chen, “Declustering Using Golden Ratio Sequences,” Proc. Int'l Conf. Data Eng., pp. 271-280, 2000.
[3] R. Bhatia, R.K. Sinha, and C.-M. Chen, “Hierarchical Declustering Schemes for Range Queries,” Proc. Int'l Conf. Extending Database Technology, pp. 525-537, 2000.
[4] S. Bryson, D. Kenwright, M. Cox, D. Ellsworth, and R. Haimes, “Visually Exploring Gigabyte Data Sets in Real Time,” Comm. ACM, vol. 42, no. 8, Aug. 1999.
[5] J.B. Campbell, Introduction to Remote Sensing, second ed. New York: Guilford Press, 1996
[6] C. Chang, B. Moon, A. Acharya, C. Shock, A. Sussman, and J. Saltz, “Titan: A High-Performance Remote-Sensing Database,” Proc. Int'l Conf. Data Eng., pp. 375-384, 1997.
[7] C.Y. Chen and C.C. Chang, “On GDM Allocation Method for Partial Range Queries,” Information Systems, vol. 17, no. 5, pp. 381–394, 1992.
[8] L.T. Chen and D. Rotem, “Declustering Objects for Visualization,” Proc. Int'l Conf. Very Large Data Bases, pp. 85-96, 1993.
[9] H.C. Du and J.S. Sobolewski, "Disk Allocation for Product Files on Multiple Disk Systems," ACM Trans. Database Systems, vol. 7, Mar. 1982.
[10] C. Faloutsos and P. Bhagwat, “Declustering Using Fractals,” Proc. Int'l Conf. Parallel and Distributed Information Systems, pp. 18-25, 1993.
[11] M.T. Fang, R.C.T. Lee, and C.C. Chang, "The Idea of Declustering and its Applications," Proc. Int'l Conf. Very Large Databases, 1986.
[12] H. Ferhatosmanoglu, D. Agrawal, and A.E. Abbadi, “Concentric Hyperspaces and Disk Allocations for Fast Parallel Range Searching,” Proc. Int'l Conf. Data Eng., pp. 608-615, 1999.
[13] N.D. Gershon and C.G. Miller, “Dealing with the Data Deluge,” IEEE Spectrum, pp. 28–32, July 1993.
[14] G. Gonnet, "Expected Length of the Longest Probe Sequence in Hash Code Searching," J. ACM, vol. 28, no. 2, pp. 289-304, 1981.
[15] K. Keeton, D. Patterson, and J.M. Hellerstein, “A Case for Intelligent Disks (IDISKS),” ACM SIGMOD Record, vol. 27, no. 3,pp. 42–52, 1998.
[16] M.H. Kim and S. Pramanik, “Optimal File Distribution for Partial Match Retrieval,” Proc. ACM Int'l Conf. Management of Data, pp. 173-182, 1988.
[17] S. Kou, M. Winslett, Y. Cho, and J. Lee, “New GDM-Based Declustering Methods for Parallel Range Queries,” Proc. Int'l Database Eng. and Applications Symp. (IDEAS), Aug. 1999.
[18] D.R. Liu and S. Shekhar, "A Similarity Graph-Based Approach to Declustering Problem and its Applications," Proc. 11th Int'l Conf. Data Eng., IEEE CS Press, 1995.
[19] D.R. Liu and S. Shekhar, “Partitioning Similarity Graphs: A Framework for Declustering Problems,” Information Systems, vol. 21, no. 6, pp. 475-496, 1996.
[20] B. Moon, A. Acharya, and J. Saltz, “Study of Scalable Declustering Algorithms for Parallel Grid Files,” Proc. Int'l Parallel Processing Symp., 1996.
[21] B. Moon and J. Saltz, “Scalability Analysis of Declustering Methods for Multidimensional Range Queries,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 2, pp. 310–327, Mar./Apr. 1998.
[22] S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, and A.E. Abbadi, “Cyclic Allocation of Two-Dimensional Data,” Proc. Int'l Conf. Data Eng., 1998.
[23] S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, and A.E. Abbadi, “Efficient Retrieval of Multidimensional Datasets through Parallel I/O,” Proc. Fifth Int'l Conf. High Performance Computing, 1998.
[24] J.A. Richards, Remote Sensing Digital Image Analysis: An Introduction. Berlin: Springer-Verlag, 1986.
[25] N. Rishe, D. Barton, N. Prabhakaran, M. Gutierrez, E. Alvarez, R. Athauda, J. Tola-Rodriguez, and A. Gonzalez., “Landsat Data Visualization via the Internet,” Proc. Int'l Symp. Spectral Sensing Research, pp. 1–9, Dec. 1997.

Index Terms:
Declustering, navigation queries, parallel databases, high performance, spatial databases.
Citation:
Chung-Min Chen, Rakesh K. Sinha, "Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 5, pp. 763-778, Sept.-Oct. 2000, doi:10.1109/69.877507
Usage of this product signifies your acceptance of the Terms of Use.