{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:05:33Z","timestamp":1775055933593,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T00:00:00Z","timestamp":1152489600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10619-006-9362-5","type":"journal-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T21:31:25Z","timestamp":1152567085000},"page":"117-147","source":"Crossref","is-referenced-by-count":17,"title":["Efficient parallel processing of range queries through replicated declustering"],"prefix":"10.1007","volume":"20","author":[{"given":"Hakan","family":"Ferhatosmanoglu","sequence":"first","affiliation":[]},{"given":"Ali \u015eaman","family":"Tosun","sequence":"additional","affiliation":[]},{"given":"Guadalupe","family":"Canahuate","sequence":"additional","affiliation":[]},{"given":"Aravind","family":"Ramachandran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,7,10]]},"reference":[{"key":"9362_CR1","doi-asserted-by":"crossref","unstructured":"K.A.S. Abdel-Ghaffar and A. El Abbadi, \u201cOptimal disk allocation for partial match queries,\u201d ACM Transactions on Database Systems, vol. 18, no. 1, pp. 132\u2013156, 1993.","DOI":"10.1145\/151284.151288"},{"key":"9362_CR2","doi-asserted-by":"crossref","unstructured":"K.A.S. Abdel-Ghaffar and A. El Abbadi, \u201cOptimal allocation of two-dimensional data,\u201d in International Conference on Database Theory, Delphi, Greece, 1997, pp. 409\u2013418.","DOI":"10.1007\/3-540-62222-5_60"},{"key":"9362_CR3","unstructured":"I. Anderson, Combinatorial Designs, Ellis Horwood Limited, 1990."},{"key":"9362_CR4","doi-asserted-by":"crossref","unstructured":"M.J. Atallah and S. Prabhakar, \u201c(Almost) optimal parallel block access for range queries,\u201d in Proceeding ACM Symp. on Principles of Database Systems, Dallas, Texas, May 2000, pp. 205\u2013215.","DOI":"10.1145\/335168.335224"},{"key":"9362_CR5","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, \u201cThe R* tree: An efficient and robust access method for points and rectangles,\u201d in Proceeding ACM SIGMOD Int. Conf. on Management of Data, May 23\u201325 1990, pp. 322\u2013331.","DOI":"10.1145\/93605.98741"},{"key":"9362_CR6","doi-asserted-by":"crossref","unstructured":"S. Berchtold, C. Bohm, B. Braunmuller, D.A. Keim, and H.-P. Kriegel, \u201cFast parallel similarity search In multimedia databases,\u201d in Proceeding ACM SIGMOD Int. Conf. on Management of Data, Arizona, U.S.A., 1997, pp. 1\u201312.","DOI":"10.1145\/253262.253263"},{"key":"9362_CR7","unstructured":"S. Berchtold, D.A. Keim, and H.P. Kreigel, \u201cThe X-tree: An index structure for highdimensional data,\u201d in 22nd Conference on Very Large Databases, Bombay, India, 1996, pp. 28\u201339."},{"key":"9362_CR8","unstructured":"D. Bertsekas and R. Gallager, Data Networks: Second Edition, Prentice Hall, 1991."},{"key":"9362_CR9","doi-asserted-by":"crossref","unstructured":"R. Bhatia, R.K. Sinha, and C. Chen, \u201cHierarchical declustering schemes for range queries,\u201d in Advances in Database Technology\u2014EDBT 2000, 7th International Conference on Extending Database Technology, Lecture Notes in Computer Science, Konstanz, Germany, March 2000, pp. 525\u2013537.","DOI":"10.1007\/3-540-46439-5_36"},{"key":"9362_CR10","doi-asserted-by":"crossref","unstructured":"R. Bose and S. Shrikhande, \u201cOn the construction of sets of mutually orthogonal latin squares and the falsity of a conjecture of euler,\u201d Euler. Trans. Am. Math. Sm., vol. 95, pp. 191\u2013209, 1960.","DOI":"10.2307\/1993286"},{"key":"9362_CR11","doi-asserted-by":"crossref","unstructured":"C. Chen, R. Bhatia, and R. Sinha, \u201cDeclustering using golden ratio sequences,\u201d in International Conference on Data Engineering, San Diego, California, Feb. 2000, pp. 271\u2013280.","DOI":"10.1109\/ICDE.2000.839419"},{"key":"9362_CR12","doi-asserted-by":"crossref","unstructured":"C. Chen and C.T. Cheng, \u201cFrom discrepancy to declustering: Near optimal multidimensional declustering strategies for range queries,\u201d in Proceeding ACM Symp. on Principles of Database Systems, Wisconsin, Madison, 2002, pp. 29\u201338.","DOI":"10.1145\/543616.543618"},{"key":"9362_CR13","doi-asserted-by":"crossref","unstructured":"C.-M. Chen and C.T. Cheng, \u201cReplication and retrieval strategies of multidimensional data on parallel disks,\u201d in CIKM 03: Proceedings of the Twelfth International Conference on Information and Knowledge Management, ACM Press, New York, NY, USA, 2003, pp. 32\u201339.","DOI":"10.1145\/956863.956871"},{"key":"9362_CR14","doi-asserted-by":"crossref","unstructured":"L. Chen and D. Rotem, \u201cOptimal response time retrieval of replicated data,\u201d in Proceeding ACM Symp. on Principles of Database Systems, Minneapolis, Minnesota, May 1994, pp. 36\u201344.","DOI":"10.1145\/182591.182596"},{"key":"9362_CR15","unstructured":"L.T. Chen and D. Rotem, \u201cDeclustering objects for visualization,\u201d in Proceedings of the Int. Conf. on Very Large Data Bases, Dublin, Ireland, Aug. 1993, pp. 85\u201396."},{"key":"9362_CR16","unstructured":"L.T. Chen, D. Rotem, and S. Seshadri, \u201cDeclustering databases on heterogeneous disk systems,\u201d in Proceedings of the Int. Conf. on Very Large Data Bases, Zurich, Switzerland, Sept. 1995, pp. 110\u2013121."},{"key":"9362_CR17","doi-asserted-by":"crossref","unstructured":"M. Chen, H. Hsiao, C. Lie, and P. Yu, \u201cUsing rotational mirrored declustering for replica placement In a disk array-based video server,\u201d in: Proceedings of the ACM Multimedia, 1995, pp. 121\u2013130.","DOI":"10.1145\/217279.215257"},{"key":"9362_CR18","doi-asserted-by":"crossref","unstructured":"B. Chor, C.E. Leiserson, R.L. Rivest, and J.B. Shearer, \u201cAn application of number theory to the organization of raster-graphics memory,\u201d Journal of the Association for Computing Machinery, vol. 33, no. 1, pp. 86\u2013104, 1986.","DOI":"10.1145\/4904.4800"},{"key":"9362_CR19","doi-asserted-by":"crossref","unstructured":"P. Ciaccia and A. Veronesi, \u201cDynamic declustering methods for parallel grid files,\u201d in Proceedings of Third International ACPC Conference with Special Emphasis on Parallel Databases and Parallel I\/O, Berlin, Germany, Sept. 1996, pp. 110\u2013123.","DOI":"10.1007\/3-540-61695-0_10"},{"key":"9362_CR20","unstructured":"M. Coyle, S. Shekhar, and Y. Zhou, \u201cEvaluation of disk allocation methods for parallelizing spatial queries on grid files,\u201d Journal of Computer and Software Engineering, 1995."},{"key":"9362_CR21","unstructured":"A. Czumaj, C. Riley, and C. Scheideler, Perfectly balanced allocation."},{"key":"9362_CR22","doi-asserted-by":"crossref","unstructured":"H.C. Du and J.S. Sobolewski, \u201cDisk allocation for cartesian product files on multiple-disk systems,\u201d ACM Transactions of Database Systems, vol. 7, no. 1, pp. 82\u2013101, 1982.","DOI":"10.1145\/319682.319698"},{"key":"9362_CR23","doi-asserted-by":"crossref","unstructured":"C. Faloutsos and P. Bhagwat, \u201cDeclustering using fractals,\u201d in Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, San Diego, CA, Jan. 1993, pp. 18\u201325.","DOI":"10.1109\/PDIS.1993.253077"},{"key":"9362_CR24","doi-asserted-by":"crossref","unstructured":"C. Faloutsos and D. Metaxas, \u201cDeclustering using error correcting codes,\u201d in Proc. ACM Symp. on Principles of Database Systems, 1989, pp. 253\u2013258.","DOI":"10.1145\/73721.73747"},{"key":"9362_CR25","unstructured":"Fan, Gupta, and Liu, \u201cLatin cubes and parallel array access,\u201d in IPPS: 8th International Parallel Processing Symposium. IEEE Computer Society Press, 1994."},{"key":"9362_CR26","doi-asserted-by":"crossref","unstructured":"H. Ferhatosmanoglu, D. Agrawal, and A.E. Abbadi, \u201cConcentric hyperspaces and disk allocation for fast parallel range searching,\u201d in Proc. Int. Conf. Data Engineering, Sydney, Australia, March 1999, pp. 608\u2013615.","DOI":"10.1109\/ICDE.1999.754977"},{"key":"9362_CR27","doi-asserted-by":"crossref","unstructured":"H. Ferhatosmanoglu, A.S. Tosun, and A. Ramachandran, \u201cReplicated declustering of spatial data,\u201d in Proc. ACM Symp. on Principles of Database Systems, June 2004.","DOI":"10.1145\/1055558.1055577"},{"key":"9362_CR28","doi-asserted-by":"crossref","unstructured":"H. Ferhatosmanoglu, A.S. Tosun, and A. Ramachandran, \u201cReplicated declustering of spatial data,\u201d in PODS 04: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM Press, New York, NY, USA. 2004, pp. 125\u2013135.","DOI":"10.1145\/1055558.1055577"},{"key":"9362_CR29","doi-asserted-by":"crossref","unstructured":"K. Frikken, \u201cOptimal distributed declustering using replication,\u201d in Tenth International Conference on Database Theory (ICDT 2005), 2005.","DOI":"10.1007\/978-3-540-30570-5_10"},{"key":"9362_CR30","doi-asserted-by":"crossref","unstructured":"K. Frikken, M. Atallah, S. Prabhakar, and R. Safavi-Naini, \u201cOptimal parallel i\/o for range queries through replication,\u201d in Proceedings of 13th International Conference of Database and Expert Systems Applications (DEXA), 2002, pp. 669\u2013678.","DOI":"10.1007\/3-540-46146-9_66"},{"key":"9362_CR31","doi-asserted-by":"crossref","unstructured":"V. Gaede and O. Gunther, \u201cMultidimensional access methods,\u201d ACM Computing Surveys, vol. 30 pp. 170\u2013231, 1998.","DOI":"10.1145\/280277.280279"},{"key":"9362_CR32","unstructured":"S. Ghandeharizadeh and D.J. DeWitt, \u201cHybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines,\u201d in Proceedings of 16th International Conference on Very Large Data Bases, Aug. 1990, pp. 481\u2013492."},{"key":"9362_CR33","unstructured":"S. Ghandeharizadeh and D.J. DeWitt, \u201cHybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines,\u201d in Proceedings of 16th International Conference on Very Large Data Bases, Aug. 1990, pp. 481\u2013492."},{"key":"9362_CR34","doi-asserted-by":"crossref","unstructured":"S. Ghandeharizadeh and D.J. DeWitt, \u201cA multiuser performance analysis of alternative declustering strategies,\u201d in Proc. Int. Conf. Data Engineering, Los Angeles, California, Feb. 1990, pp. 466\u2013475.","DOI":"10.1109\/ICDE.1990.113500"},{"key":"9362_CR35","doi-asserted-by":"crossref","unstructured":"S. Ghandeharizadeh and D.J. DeWitt, \u201cA performance analysis of alternative multi-attribute declustering strategies,\u201d in Proc. ACM SIGMOD Int. Conf. on Management of Data, San Diego, 1992, pp. 29\u201338.","DOI":"10.1145\/141484.130293"},{"key":"9362_CR36","doi-asserted-by":"crossref","unstructured":"S. Ghandeharizadeh, D.J. DeWitt, and W. Qureshi, \u201cA performance analysis of alternative multiattribute declustering strategies,\u201d in Proceedings of the ACM SIGMOD International Conference on Management of Data, June 1992, pp. 29\u201338.","DOI":"10.1145\/130283.130293"},{"key":"9362_CR37","unstructured":"L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu, \u201cApproximation algorithms for data placement on parallel disks,\u201d in Symposium on Discrete Algorithms, 2000, pp. 223\u2013232."},{"key":"9362_CR38","unstructured":"J. Gray, B. Horst, and M. Walker, \u201cParity striping of disc arrays: Low-cost reliable storage with acceptable throughput,\u201d in Proceedings of the Int. Conf. on Very Large Data Bases, Washington DC, Aug. 1990, pp. 148\u2013161."},{"key":"9362_CR39","doi-asserted-by":"crossref","unstructured":"A. Guttman, \u201cR-trees: A dynamic index structure for spatial searching,\u201d in Proc. ACM SIGMOD Int. Conf. on Management of Data, 1984, pp. 47\u201357.","DOI":"10.1145\/971697.602266"},{"key":"9362_CR40","unstructured":"K.A. Hua and H.C. Young, \u201cA general multidimensional data allocation method for multicomputer database systems,\u201d in Database and Expert System Applications, Toulouse, France, Sept. 1997, pp. 401\u2013409."},{"key":"9362_CR41","doi-asserted-by":"crossref","unstructured":"I. Kamel and C. Faloutsos, \u201cParallel R-trees,\u201d in Proc. ACM SIGMOD Int. Conf. on Management of Data, San Diego, CA, June 1992, pp. 195\u2013204.","DOI":"10.1145\/141484.130315"},{"key":"9362_CR42","doi-asserted-by":"crossref","unstructured":"K. Kim and V.K. Prasanna-Kumar, \u201cLatin squares for parallel array access,\u201d IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 4, pp. 361\u2013370, 1993.","DOI":"10.1109\/71.219753"},{"key":"9362_CR43","doi-asserted-by":"crossref","unstructured":"M.H. Kim and S. Pramanik, \u201cOptimal file distribution for partial match retrieval,\u201d in Proc. ACM SIGMOD Int. Conf. on Management of Data, Chicago, 1988, pp. 173\u2013182.","DOI":"10.1145\/971701.50221"},{"key":"9362_CR44","unstructured":"J. Li, J. Srivastava, and D. Rotem, \u201cCMD: A multidimensional declustering method for parallel database systems,\u201d in Proceedings of the Int. Conf. on Very Large Data Bases, Vancouver, Canada, Aug. 1992, pp. 3\u201314."},{"key":"9362_CR45","unstructured":"B. Moon, A. Acharya, and J. Saltz, \u201cStudy of scalable declustering algorithms for parallel grid files,\u201d in Proceeding. of the Parallel Processing Symposium, April 1996."},{"key":"9362_CR46","doi-asserted-by":"crossref","unstructured":"R. Muntz, J. Santos, and S. Berson, \u201cA parallel disk storage system for real-time multimedia applications,\u201d International Journal of Intelligent Systems, Special Issue on Multimedia Computing System, vol. 13, no. 12, 1998, pp. 1137\u20131174.","DOI":"10.1002\/(SICI)1098-111X(199812)13:12<1137::AID-INT4>3.0.CO;2-M"},{"key":"9362_CR47","unstructured":"R.-T. Portal, \u201cNorth east dataset,\u201d http:\/\/www.rteeportal.org\/datasets\/spatial\/US\/NE.zip."},{"key":"9362_CR48","unstructured":"R.-T. Portal, \u201cSequoia dataset,\u201d http:\/\/www.rteeportal.org\/datasets\/spatial\/US\/Sequoia.zip."},{"key":"9362_CR49","doi-asserted-by":"crossref","unstructured":"S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, and A. El Abbadi, \u201cCyclic allocation of two-dimensional data,\u201d in International Conference on Data Engineering, Orlando, Florida, Feb. 1998, pp. 94\u2013101.","DOI":"10.1109\/ICDE.1998.655763"},{"key":"9362_CR50","doi-asserted-by":"crossref","unstructured":"S. Prabhakar, D. Agrawal, and A. El Abbadi, \u201cEfficient disk allocation for fast similarity searching,\u201d in 10th International Symposium on Parallel Algorithms and Architectures, SPAA98, Puerto Vallarta, Mexico, June 1998, pp. 78\u201387.","DOI":"10.1145\/277651.277674"},{"key":"9362_CR51","unstructured":"H. Samet, The Design and Analysis of Spatial Structures, AddisonWesley Publishing Company, Inc., Massachusetts, 1989."},{"key":"9362_CR52","unstructured":"J. Santos and R. Muntz, \u201cDesign of the RIO (randomized I\/O) storage server. Technical Report TR970032,\u201d UCLA Computer Science Department, 1997. http:\/\/mml.cs.ucla.edu\/publications\/papers\/cstech970032.ps."},{"key":"9362_CR53","unstructured":"Seagate. Seagate specifications, December 2003. http:\/\/www.seagate.com\/pdf\/datasheets\/."},{"key":"9362_CR54","doi-asserted-by":"crossref","unstructured":"S. Shekhar and D.R. Liu, \u201cPartitioning similarity graphs: A framework for declustering problems,\u201d Information Systems, vol. 21, no. 4, pp. 475\u2013496, 1996.","DOI":"10.1016\/0306-4379(96)00024-5"},{"key":"9362_CR55","doi-asserted-by":"crossref","unstructured":"S. Shekhar, S. Ravada, V. Kumar, D. Chubb, and G. Turner, \u201cDeclustering and load balancing methods for parallelizing geographical information systems,\u201d IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 4, pp. 632\u2013655, 1998.","DOI":"10.1109\/69.706061"},{"key":"9362_CR56","doi-asserted-by":"crossref","unstructured":"R.K. Sinha, R. Bhatia, and C. Chen, \u201cAsymptotically optimal declustering schemes for range queries,\u201d in 8th International Conference on Database Theory, Lecture Notes In Computer Science, London, UK Springer, Jan. 2001, pp. 144\u2013158.","DOI":"10.1007\/3-540-44503-X_10"},{"key":"9362_CR57","unstructured":"A.S. Tosun and H. Ferhatosmanoglu, \u201cOptimal parallel I\/O using replication,\u201d in Proceedings of International Workshops on Parallel Processing (ICPP), Vancouver, Canada, Aug. 2002."}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-006-9362-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-006-9362-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-006-9362-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T21:21:09Z","timestamp":1736457669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-006-9362-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,10]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["9362"],"URL":"https:\/\/doi.org\/10.1007\/s10619-006-9362-5","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,10]]}}}