{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T03:40:01Z","timestamp":1752464401514,"version":"3.41.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distributed and Parallel Databases"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1019269409432","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T19:09:50Z","timestamp":1045681790000},"page":"269-288","source":"Crossref","is-referenced-by-count":16,"title":["A Hypergraph Based Approach to Declustering Problems"],"prefix":"10.1007","volume":"10","author":[{"given":"Duen-Ren","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei-Yu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"386408_CR1","doi-asserted-by":"crossref","unstructured":"R. Bhatia, R. Sinha, and C.-M. Chen. \u201cHierarchical declustering schemes for range queries,\u201d in Proc. of 7th Intl Conference on Extending Database Technology, EDBT, Konstanz, Germany, 2000, pp. 525\u2013540.","DOI":"10.1007\/3-540-46439-5_36"},{"key":"386408_CR2","doi-asserted-by":"crossref","unstructured":"R. Bhatia, R.K. Sinha, and C.-M. Chen. \u201cDeclustering using golden ratio sequences,\u201d in Proc. of the 16th Intl Conference on Data Engineering, IEEE, San Diego, California, USA, 2000, pp. 271\u2013280.","DOI":"10.1109\/ICDE.2000.839419"},{"key":"386408_CR3","unstructured":"L.T. Chen and D. Rotem, \u201cDeclustering objects for visualization,\u201d in Proc. of Intl Conference on Very Large Data Bases, 1993, pp. 85\u201396."},{"issue":"12","key":"386408_CR4","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/43.103500","volume":"10","author":"C.K. Cheng","year":"1991","unstructured":"C.K. Cheng and Y.C. Wei, \u201cAn improved two-way partitioning algorithm with stable performance,\u201d IEEE Trans. on Computer-Aided Design, vol. 10, no. 12, pp. 1502\u20131511, 1991.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"386408_CR5","doi-asserted-by":"crossref","unstructured":"D.J. DeWitt et al., \u201cThe gamma database machine project,\u201d IEEE Trans. on Knowledge and Data Engineering, vol. 2, no. 1, 1990.","DOI":"10.1109\/69.50905"},{"issue":"1","key":"386408_CR6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/319682.319698","volume":"7","author":"H.C. Du","year":"1982","unstructured":"H.C. Du and J.S. Sobolewski, \u201cDisk allocation for product files on multiple disk systems,\u201d ACM Trans. on Database Systems, vol. 7, no. 1, pp. 82\u2013101, 1982.","journal-title":"ACM Trans. on Database Systems"},{"key":"386408_CR7","doi-asserted-by":"crossref","unstructured":"C. Faloutsos and P. Bhagwat, \u201cDeclustering using fractals,\u201d in Proc. of Intl. Symposium on Databases in Parallel and Distributed Systems, 1993, pp. 18\u201325.","DOI":"10.1109\/PDIS.1993.253077"},{"issue":"8","key":"386408_CR8","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/12.83636","volume":"40","author":"C. Faloutsos","year":"1991","unstructured":"C. Faloutsos and D. Metaxas, \u201cDisk allocation methods using error correcting codes,\u201d IEEE Trans. on Computers, vol. 40, no. 8, pp. 907\u2013914, 1991.","journal-title":"IEEE Trans. on Computers"},{"key":"386408_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman: San Francisco, 1979."},{"key":"386408_CR10","doi-asserted-by":"crossref","unstructured":"S. Ghandeharizadeh and D.J. DeWitt, \u201cAmultiuser performance analysis of alternative declustering strategies,\u201d in Proc. of the 6th Intl. Conference on Data Engineering, IEEE, 1990, pp. 466\u2013475.","DOI":"10.1109\/ICDE.1990.113500"},{"key":"386408_CR11","unstructured":"S. Ghandeharizadeh and D.J. DeWitt, \u201cHybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machine,\u201d in Proc. of Intl. Conference on Very Large Databases, VLDB, 1990, pp. 481\u2013492."},{"key":"386408_CR12","doi-asserted-by":"crossref","unstructured":"S. Ghandeharizadeh, D.J. DeWitt, and W. Qureshi, \u201cA performance analysis of alternative multiattribute declustering strategies,\u201d in Proc. of Intl. Conference on Management of Data, ACM SIGMOD, 1992, pp. 29\u201338.","DOI":"10.1145\/130283.130293"},{"key":"386408_CR13","doi-asserted-by":"crossref","unstructured":"I. Kamel and C. Faloutsos, \u201cParallel R-trees,\u201d in Proc. of Intl. Conference on Management of Data, ACM SIGMOD, 1992, pp. 195\u2013204.","DOI":"10.1145\/130283.130315"},{"issue":"2","key":"386408_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"B.W. Kernighan and S. Lin, \u201cAn efficient heuristic procedure for partitioning graphs,\u201d Bell Syst. Tech. J., vol. 49, no. 2, pp. 291\u2013307, 1970.","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"386408_CR15","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/71.219753","volume":"4","author":"K. Kim","year":"1993","unstructured":"K. Kim and V.K. Prasanna, \u201cLatin squares for parallel array access,\u201d IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 4, pp. 361\u2013370, 1993.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"386408_CR16","doi-asserted-by":"crossref","unstructured":"M.H. Kim and S. Pramanik, \u201cOptimal file distribution for partial match queries,\u201d in Proc. of SIGMOD Conference on Management of Data, ACM, 1988, pp. 173\u2013182.","DOI":"10.1145\/50202.50221"},{"key":"386408_CR17","doi-asserted-by":"crossref","unstructured":"V. Kouramajian, R. Elmasri, and A. Chaudhry, \u201cDeclustering techniques for parallelizing temporal access structures,\u201d in Proc. of the Tenth Intl. Conference on Data Engineering, IEEE, 1994, pp. 232\u2013244.","DOI":"10.1109\/ICDE.1994.283036"},{"key":"386408_CR18","unstructured":"J. Li, J. Srivastava, and D. Rotem, \u201cCMD: A multidimensional declustering method for parallel database systems,\u201d in Proc. of Intl. Conference on Very Large Data Bases, 1992, pp. 3\u201314."},{"issue":"6","key":"386408_CR19","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0306-4379(96)00024-5","volume":"21","author":"D.R. Liu","year":"1996","unstructured":"D.R. Liu and S. Shekhar, \u201cPartitioning similarity graphs:Aframework for declustering problems,\u201d Information Systems: An International Journal, vol. 21, no. 6, pp. 475\u2013496, 1996.","journal-title":"Information Systems: An International Journal"},{"key":"386408_CR20","doi-asserted-by":"crossref","unstructured":"S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, and A. El Abbadi. \u201cCyclic allocation of two-dimensional data,\u201d in Proc. of the 14th Intl Conference on Data Engineering, IEEE, Orlando, Florida, USA, 1998, pp. 94\u2013101.","DOI":"10.1109\/ICDE.1998.655763"},{"issue":"5","key":"386408_CR21","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1109\/69.243516","volume":"5","author":"D. Rotem","year":"1993","unstructured":"D. Rotem, G.A. Schloss, and A. Segev, \u201cData allocation for multidisk databases,\u201d IEEE Trans. on Knowledge and Data Engineering, vol. 5, no. 5, pp. 882\u2013887, 1993.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"386408_CR22","doi-asserted-by":"crossref","unstructured":"B. Seeger and P.A. Larson, \u201cMulti-disk B-trees,\u201d in Proc. of Intl. Conference on Management of Data, ACM SIGMOD, 1991, pp. 436\u2013445.","DOI":"10.1145\/115790.115862"},{"key":"386408_CR23","doi-asserted-by":"crossref","unstructured":"Y. Zhou, S. Shekhar, and M. Coyle, \u201cDisk allocation methods for parallelizing grid files,\u201d in Proc. of the Tenth Intl. Conference on Data Engineering, IEEE, 1994, pp. 243\u2013252.","DOI":"10.1109\/ICDE.1994.283037"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019269409432.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019269409432\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019269409432.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T03:00:09Z","timestamp":1752462009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019269409432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["386408"],"URL":"https:\/\/doi.org\/10.1023\/a:1019269409432","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}