
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChungMin Chen, Randeep Bhatia, Rakesh K. Sinha, "Multidimensional Declustering Schemes Using Golden Ratio and Kronecker Sequences," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 3, pp. 659670, May/June, 2003.  
BibTex  x  
@article{ 10.1109/TKDE.2003.1198397, author = {ChungMin Chen and Randeep Bhatia and Rakesh K. Sinha}, title = {Multidimensional Declustering Schemes Using Golden Ratio and Kronecker Sequences}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {15}, number = {3}, issn = {10414347}, year = {2003}, pages = {659670}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2003.1198397}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Multidimensional Declustering Schemes Using Golden Ratio and Kronecker Sequences IS  3 SN  10414347 SP659 EP670 EPD  659670 A1  ChungMin Chen, A1  Randeep Bhatia, A1  Rakesh K. Sinha, PY  2003 KW  Declustering KW  disk allocation KW  parallel databases. VL  15 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—We propose a new declustering scheme for allocating uniform multidimensional data among parallel disks. The scheme, aimed at reducing disk access time for range queries, is based on Golden Ratio Sequences for two dimensions and Kronecker Sequences for higher dimensions. Using exhaustive simulation, we show that, in two dimensions, the worstcase (additive) deviation of the scheme from the optimal response time for any range query is one when the number of disks (
[1] K. AbdelGhaffar and A.E. Abbadi, “Optimal Allocation of TwoDimensional Data,” Proc. Int'l Conf. Database Theory, pp. 409418, 1997.
[2] M.J. Atallah and S. Prabhakar, “(Almost) Optimal Parallel Block Access for Range Queries,” Proc. ACM Symp. Principles of Database Systems, pp. 205215, 2000.
[3] A. BarNoy, R. Bhatia, J. Naor, and B. Schieber, “Minimizing Service and Operation Costs of Periodic Scheduling,” Proc. Ninth ACMSIAM Symp. Discrete Algorithms (SODA '98), pp. 1120, 1998.
[4] J. Beck, “Probabilistic Diophantine Approximation, I Kronecker Sequences,” Ann. Math., 1994.
[5] S. Berchtold, C. Böhm, B. Braunmüller, D. Keim, and H.P. Kriegel, “Fast Parallel Similarity Search in Multimedia Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 112, 1997.
[6] R. Bhatia, R.K. Sinha, and C.M. Chen, “Declustering Using Golden Ratio Sequences,” Proc. Int'l Conf. Data Eng., pp. 271280, 2000.
[7] R. Bhatia, R.K. Sinha, and C.M. Chen, “Hierarchical Declustering Schemes for Range Queries,” Proc. Int'l Conf. Extending Database Technology, pp. 525537, 2000.
[8] C. Chang, B. Moon, A. Acharya, C. Shock, A. Sussman, and J. Saltz, “Titan: A HighPerformance RemoteSensing Database,” Proc. Int'l Conf. Data Eng., pp. 375384, 1997.
[9] C.M. Chen, R. Bhatia, and R. Sinha, “Declustering Using Golden Ratio and Kronecker Sequences,” technical report, Applied Research, Telcordia Tech nologies, 2002.
[10] C.M. Chen and C. Cheng, “From Discrepancy to Declustering: Near Optimal Multidimensional Declustering Strategies for Range Queries,” Proc. ACM Symp. Database Principles, pp. 2938, 2002.
[11] C.M. Chen and R. Sinha, “Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries,” IEEE Trans. Knowledge and Data Eng., vol. 12, no. 5, pp. 763778, 2000.
[12] L.T. Chen and D. Rotem, “Declustering Objects for Visualization,” Proc. Int'l Conf. Very Large Data Bases, pp. 8596, 1993.
[13] H.C. Du and J.S. Sobolewski, "Disk Allocation for Product Files on Multiple Disk Systems," ACM Trans. Database Systems, vol. 7, Mar. 1982.
[14] C. Faloutsos and P. Bhagwat, “Declustering Using Fractals,” Proc. Int'l Conf. Parallel and Distributed Information Systems, pp. 1825, 1993.
[15] 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.
[16] 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. 608615, 1999.
[17] N.D. Gershon and C.G. Miller, “Dealing with the Data Deluge,” IEEE Spectrum, 1993.
[18] A. Itai and Z. Rosberg, “A Golden Ratio Control Policy for a MultipleAccess Channel,” IEEE Trans. Automatic Control, vol. 29, pp. 712718, 1984.
[19] M.H. Kim and S. Pramanik, “Optimal File Distribution for Partial Match Retrieval,” Proc. ACM Int'l Conf. Management of Data, pp. 173182, 1988.
[20] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. AddisonWesley, 1973.
[21] S. Kou, M. Winslett, Y. Cho, and J. Lee, “New GDMBased Declustering Methods for Parallel Range Queries,” Proc. Int'l Database Eng. and Applications Symp., pp. 119127, 1999.
[22] J. Li, J. Srivastava, and D. Rotem, “CMD: A Multidimensional Declustering Method for Parallel Database Systems,” Proc. Int'l Conf. Very Large Databases, pp. 314, 1992.
[23] D.R. Liu and S. Shekhar, “Partitioning Similarity Graphs: A Framework for Declustering Problems,” Information Systems, vol. 21, no. 6, pp. 475496, 1996.
[24] Y.L. Lo, K. Hua, and H. Young, “GeMDA: A Multidimensional Data Partitioning Technique for Multiprocessor Database Systems,” Distributed and Parallel Databases, vol. 9, no. 3, 2001. (A preliminary version appeared in DEXA 1997).
[25] J. Matousek, Geometric Discrepancy, an Illustrated Guide. SpringerVerlag, 1999.
[26] J.M. May, Parallel I/O for High Performance Computing. Morgan Kaufmann, 2001.
[27] B. Moon, A. Acharya, and J. Saltz, “Study of Scalable Declustering Algorithms for Parallel Grid Files,” Proc. Int'l Parallel Processing Symp., 1996.
[28] S. Prabhakar, personal communication, 2001.
[29] S. Prabhakar, K. AbdelGhaffar, D. Agrawal, and A.E. Abbadi, “Cyclic Allocation of TwoDimensional Data,” Proc. Int'l Conf. Data Eng., 1998.
[30] S. Prabhakar, K. AbdelGhaffar, D. Agrawal, and A.E. Abbadi, “Efficient Retrieval of Multidimensional Datasets through Parallel I/O,” Proc. Fifth Int'l Conf. High Performance Computing, 1998.
[31] R.K. Sinha, R. Bhatia, and C.M. Chen, “Asymptotically Optimal Declustering Schemes for 2dim Range Queries,” Theoretical Computer Science, to appear. (A preliminary version appeared in Int'l Conf. Database Theory, 2001.).
[32] H. Weyl, “Uber die gleichverteilung von zahlem mod eins,” Math. Ann., 1916.
[33] Y. Zhou, S. Shekhar, and M. Coyle, "Disk Allocation Methods for Parallelizing Grid Files," Proc. 10th Int'l Conf. Data Eng., IEEE CS Press, 1994.