
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Nihat Altiparmak, Ali Şaman Tosun, "Equivalent Disk Allocations," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 3, pp. 538546, March, 2012.  
BibTex  x  
@article{ 10.1109/TPDS.2011.177, author = {Nihat Altiparmak and Ali Şaman Tosun}, title = {Equivalent Disk Allocations}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {3}, issn = {10459219}, year = {2012}, pages = {538546}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.177}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Equivalent Disk Allocations IS  3 SN  10459219 SP538 EP546 EPD  538546 A1  Nihat Altiparmak, A1  Ali Şaman Tosun, PY  2012 KW  Declustering KW  parallel I/0 KW  number theory KW  range query. VL  23 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] Project Webpage, http://gozde.cs.utsa.eduallocations, 2011.
[2] K.A.S. AbdelGhaffar and A. El Abbadi, "Optimal Allocation of TwoDimensional Data," Proc. Sixth Int'l Conf. Database Theory (ICDT), pp. 409418, Jan. 1997.
[3] M.J. Atallah and S. Prabhakar, "(Almost) Optimal Parallel Block Access for Range Queries," Proc. 19th ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems (PODS), pp. 205215, May 2000.
[4] N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, "The R∗ Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322331, 1990.
[5] R. Bhatia, R.K. Sinha, and C.M. Chen, "Hierarchical Declustering Schemes for Range Queries," Proc. Seventh Int'l Conf. Extending Database Technology (EDBT), pp. 525537, Mar. 2000.
[6] C.M. Chen, R. Bhatia, and R. Sinha, "Declustering Using Golden Ratio Sequences," Proc. 16th Int'l Conf. Data Eng. (ICDE), pp. 271280, 2000.
[7] C.M. Chen and C. Cheng, "Replication and Retrieval Strategies of Multidimensional Data on Parallel Disks," Proc. Conf. Information and Knowledge Management (CIKM), Nov. 2003.
[8] C.M. Chen and C.T. Cheng, "From Discrepancy to Declustering: Near Optimal Multidimensional Declustering Strategies for Range Queries," Proc. 21st ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems (PODS), pp. 2938, 2002.
[9] H.C. Du and J.S. Sobolewski, "Disk Allocation for Cartesian Product Files on MultipleDisk Systems," ACM Trans. Database Systems, vol. 7, no. 1, pp. 82101, Mar. 1982.
[10] C. Faloutsos and P. Bhagwat, "Declustering Using Fractals," Proc. Second Int'l Conf. Parallel and Distributed Information Systems, pp. 1825, Jan. 1993.
[11] C. Fan, A. Gupta, and J. Liu, "Latin Cubes and Parallel Array Access," Proc. Eighth Int'l Parallel Processing Symp., 1994.
[12] H. Ferhatosmanoglu, A.Ş. Tosun, G. Canahuate, and A. Ramachandran, "Efficient Parallel Processing of Range Queries through Replicated Declustering," J. Distributed and Parallel Databases, vol. 20, pp. 117147, 2006.
[13] H. Ferhatosmanoglu, A.Ş. Tosun, and A. Ramachandran, "Replicated Declustering of Spatial Data," Proc. 23rd ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems, pp. 125135, June 2004.
[14] K. Frikken, "Optimal Distributed Declustering Using Replication," Proc. 10th Int'l Conf. Database Theory (ICDT), pp. 144157, 2005.
[15] K. Frikken, M. Atallah, S. Prabhakar, and R. SafaviNaini, "Optimal Parallel I/O for Range Queries through Replication," Proc. 13th Int'l Conf. Database and Expert Systems Applications (DEXA), pp. 669678, 2002.
[16] V. Gaede and O. Gunther, "Multidimensional Access Methods," ACM Computing Surveys, vol. 30, pp. 170231, 1998.
[17] S. Ghandeharizadeh and D.J. DeWitt, "HybridRange Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines," Proc. 16th Int'l Conf. Very Large Databases (VLDB), pp. 481492, Aug. 1990.
[18] S. Ghandeharizadeh and D.J. DeWitt, "A Multiuser Performance Analysis of Alternative Declustering Strategies," Proc. Sixth Int'l Conf. Data Eng. (ICDE), pp. 466475, Feb. 1990.
[19] A. Guttman, "RTrees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 4757, 1984.
[20] K.A. Hua and H.C. Young, "A General Multidimensional Data Allocation Method for Multicomputer Database Systems," Proc. Database and Expert System Applications, pp. 401409, Sept. 1997.
[21] K. Kim and V.K. PrasannaKumar, "Latin Squares for Parallel Array Access," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 361370, Apr. 1993.
[22] M.H. Kim and S. Pramanik, "Optimal File Distribution for Partial Match Retrieval," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 173182, 1988.
[23] M. Koyuturk and C. Aykanat, "IterativeImprovementBased Declustering Heuristics for MultiDisk Databases," Information Systems, vol. 30, no. 9, pp. 4770, 2005.
[24] D. Liu and M. Wu, "A Hypergraph Based Approach to Declustering Problems," Distributed and Parallel Databases, vol. 10, no. 3, pp. 269288, 2001.
[25] K. Mehlhorn and S. Näher, "Leda: A Platform for Combinatorial and Geometric Computing," Comm. ACM, vol. 38, no. 1, pp. 96102, 1995.
[26] K. Yasin Oktay, A. Turk, and C. Aykanat, "Selective Replicated Declustering for Arbitrary Queries," Proc. 15th Int'l EuroPar Conf. Parallel Processing, pp. 375386, 2009.
[27] S. Prabhakar, K. AbdelGhaffar, D. Agrawal, and A. El Abbadi, "Cyclic Allocation of TwoDimensional Data," Proc. 14th Int'l Conf. Data Eng. (ICDE), pp. 94101, 1998.
[28] S. Prabhakar, D. Agrawal, and A. El Abbadi, "Efficient Disk Allocation for Fast Similarity Searching," Proc. 10h Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '98) pp. 7887, June 1998.
[29] H. Samet, The Design and Analysis of Spatial Structures. Addison Wesley, 1989.
[30] P. Sanders, S. Egner, and K. Korst, "Fast Concurrent Access to Parallel Disks," Proc. 11th ACMSIAM Symp. Discrete Algorithms, 2000.
[31] H. Shapiro, Introduction to the Theory of Numbers. John Wiley and Sons, 1983.
[32] S. Shektar and D. Liu, "Partitioning Similarity Graphs: A Framework for Declustering Problems," Information Systems, vol. 21, no. 6, pp. 475496, 1996.
[33] A.Ş. Tosun, "Replicated Declustering for Arbitrary Queries," Proc. ACM Symp. Applied Computing, pp. 748753, Mar. 2004.
[34] A.Ş. Tosun, "Constrained Declustering," Proc. Int'l Conf. Information Technology Coding and Computing, pp. 232237, Apr. 2005.
[35] A.Ş. Tosun, "Design Theoretic Approach to Replicated Declustering," Proc. Int'l Conf. Information Technology Coding and Computing, pp. 226231, Apr. 2005.
[36] A.Ş. Tosun, "Threshold Based Declustering in High Dimensions," Proc. Int'l Conf. Database and Expert Systems Applications, pp. 818827, Aug. 2005.
[37] A.Ş. Tosun, "Efficient Retrieval of Replicated Data," J. Distributed and Parallel Databases, vol. 19, nos. 2/3, pp. 107124, 2006.
[38] A.Ş. Tosun, "Analysis and Comparison of Replicated Declustering Schemes," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 11, pp. 15781591, Nov. 2007.
[39] A.Ş. Tosun, "Equivalent Disk Allocations," Proc. 22nd ACM Symp. Applied Computing, pp. 500505, 2007.
[40] A.Ş. Tosun, "ThresholdBased Declustering," Information Sciences, vol. 177, no. 5, pp. 13091331, 2007.
[41] A.Ş. Tosun and H. Ferhatosmanoglu, "Optimal Parallel I/O Using Replication," Proc. Int'l Conf. Parallel Processing (ICPP), pp. 506513, Aug. 2002.