{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:56:23Z","timestamp":1770998183084,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,1,23]],"date-time":"2009-01-23T00:00:00Z","timestamp":1232668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10115-008-0182-y","type":"journal-article","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T11:52:48Z","timestamp":1232625168000},"page":"349-373","source":"Crossref","is-referenced-by-count":30,"title":["A new ant colony optimization based algorithm for data allocation problem in distributed databases"],"prefix":"10.1007","volume":"20","author":[{"given":"Rosa","family":"Karimi Adl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Mohammad Taghi","family":"Rouhani Rankoohi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,23]]},"reference":[{"issue":"1","key":"182_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013324605452","volume":"11","author":"I Ahmad","year":"2002","unstructured":"Ahmad I, Karlapalem K, Kwok YK et\u00a0al (2002) Evolutionary algorithms for allocating data in distributed database systems. Int J Distrib Parallel Databases 11(1): 5\u201332. doi: 10.1023\/A:1013324605452","journal-title":"Int J Distrib Parallel Databases"},{"issue":"4","key":"182_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1093\/comjnl\/27.4.315","volume":"27","author":"DA Bell","year":"1984","unstructured":"Bell DA (1984) Difficult data placement problems. Comput J 27(4): 315\u2013320","journal-title":"Comput J"},{"key":"182_CR3","volume-title":"Distributed database systems","author":"D Bell","year":"1992","unstructured":"Bell D, Grimson J (1992) Distributed database systems. Addison-Wesley Longman Publishing Co., Inc, Boston"},{"key":"182_CR4","doi-asserted-by":"crossref","unstructured":"Brunstrom A, Leutenegger ST, Simha R (1995) Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads. ICASE: Institute for Computer Applications in Science and Engineering","DOI":"10.1145\/221270.221652"},{"key":"182_CR5","doi-asserted-by":"crossref","unstructured":"Buchholz S, Buchholz T (2004) Replica placement in adaptive content distribution networks. In: SAC \u201904: proceedings of the 2004 ACM symposium on applied computing, Nicosia, pp 1705\u20131710","DOI":"10.1145\/967900.968238"},{"key":"182_CR6","volume-title":"Distributed databases principles and systems","author":"S Ceri","year":"1984","unstructured":"Ceri S, Pelagatti G (1984) Distributed databases principles and systems. McGraw-Hill, Inc., New York"},{"issue":"10","key":"182_CR7","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/T-C.1969.222542","volume":"18","author":"WW Chu","year":"1969","unstructured":"Chu WW (1969) Optimal file allocation in a multiple computer system. IEEE Trans Comput 18(10): 885\u2013889","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"182_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s446-002-8031-5","volume":"15","author":"SA Cook","year":"2002","unstructured":"Cook SA, Pachl JK, Pressman IS (2002) The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy. Distrib Comput 15(1): 57\u201366","journal-title":"Distrib Comput"},{"key":"182_CR9","doi-asserted-by":"crossref","unstructured":"Corcoran AL, Hale J (1994) A genetic algorithm for fragment allocation in a distributed database system. In: SAC \u201994: proceedings of the 1994 ACM symposium on applied computing, Phoenix, pp 247\u2013250","DOI":"10.1145\/326619.326738"},{"key":"182_CR10","volume-title":"Introduction to operations research techniques","author":"HG Daellenbach","year":"1983","unstructured":"Daellenbach HG, George JA, McNickle DC (1983) Introduction to operations research techniques (2nd edn). Allyn and Bacon, Boston","edition":"2"},{"key":"182_CR11","unstructured":"Di Caro G, Dorigo M (1998) An adaptive multi-agent routing algorithm inspired by ants behavior. In: Proceedings of PART98-5th annual Australasian conference on parallel and real-time systems, Singapore, pp 261\u2013272"},{"key":"182_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, Stutzle T (2004) Ant colony optimization. MIT Press, Cambridge"},{"issue":"4","key":"182_CR13","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1109\/69.617055","volume":"9","author":"O Frieder","year":"1997","unstructured":"Frieder O, Siegelmann HT (1997) Multiprocessor document allocation: A genetic algorithm approach. IEEE Trans Knowl Data Eng 9(4): 640\u2013642","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"182_CR14","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1109\/TPDS.2006.127","volume":"17","author":"X Gu","year":"2006","unstructured":"Gu X, Lin W (2006) Practically realizable efficient data allocation and replication strategies for distributed databases with buffer constraints. IEEE Trans Parallel Distrib Syst 17(9): 1001\u20131013","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"182_CR15","doi-asserted-by":"crossref","unstructured":"Ibrahim H (2005) Checking integrity constraints in a distributed database. Encyclopedia of database technologies and applications, pp 66\u201373","DOI":"10.4018\/978-1-59140-560-3.ch012"},{"key":"182_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economics activities. Econometrica 25: 53\u201376","journal-title":"Econometrica"},{"issue":"3","key":"182_CR17","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/TC.1983.1676215","volume":"32","author":"LJ Laning","year":"1983","unstructured":"Laning LJ, Leonard MS (1983) File allocation in a distributed computer communication network. IEEE Trans Comput 32(3): 232\u2013244","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"182_CR18","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10115-003-0082-0","volume":"5","author":"Z Lee","year":"2003","unstructured":"Lee Z, Su S, Lee C et\u00a0al (2003) A heuristic genetic algorithm for solving resource allocation problems. Knowl Inf Syst 5(4): 503\u2013511","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"182_CR19","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo V (1999) Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. Inf J Comput 11(4): 358\u2013369","journal-title":"Inf J Comput"},{"issue":"5","key":"182_CR20","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo V, Colorni A (1999) The ant system applied to the quadratic assignment problem. IEEE Trans Knowl Data Eng 11(5): 769\u2013778","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"182_CR21","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/TPDS.2003.1233711","volume":"14","author":"A Mei","year":"2003","unstructured":"Mei A, Mancini LV, Jajodia S (2003) Secure dynamic fragment and replica allocation in large-scale distributed file systems. IEEE Trans Parallel Distrib Syst 14(9): 885\u2013896","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"7","key":"182_CR22","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TPDS.2005.77","volume":"16","author":"S Menon","year":"2005","unstructured":"Menon S (2005) Allocating fragments in distributed databases. IEEE Trans Parallel Distrib Syst 16(7): 577\u2013585","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"182_CR23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1020999407672","volume":"18","author":"D Merkle","year":"2003","unstructured":"Merkle D, Middendorf M (2003) Ant colony optimization with global pheromone evaluation for scheduling a single machine. Appl Intell 18(1): 105\u2013111","journal-title":"Appl Intell"},{"issue":"4","key":"182_CR24","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1145\/1994.2209","volume":"9","author":"S Navathe","year":"1984","unstructured":"Navathe S, Ceri S, Wiederhold G et\u00a0al (1984) Vertical partitioning algorithms for database design. ACM Trans Database Syst 9(4): 680\u2013710","journal-title":"ACM Trans Database Syst"},{"key":"182_CR25","unstructured":"Ozsu T, Valduriez P (1999) Principles of distributed database systems, 2nd edition"},{"issue":"1","key":"182_CR26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/S0129065789000414","volume":"1","author":"C Peterson","year":"1989","unstructured":"Peterson C, Soderberg B (1989) A new method for mapping optimization problems onto neural networks. Int J Neural Syst 1(1): 3\u201322","journal-title":"Int J Neural Syst"},{"issue":"3","key":"182_CR27","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/69.91051","volume":"3","author":"S Ram","year":"1991","unstructured":"Ram S, Marsten RE (1991) A model for database allocation incorporating a concurrency control mechanism. IEEE Trans Knowl Data Eng 3(3): 389\u2013395","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"182_CR28","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23(3): 555\u2013565","journal-title":"J ACM"},{"issue":"3","key":"182_CR29","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1016\/S0377-2217(96)00234-2","volume":"102","author":"R Sarathy","year":"1997","unstructured":"Sarathy R, Shetty B, Sen A (1997) A constrained nonlinear 0\u20131 program for data allocation. Eur J Oper Res 102(3): 626\u2013647","journal-title":"Eur J Oper Res"},{"issue":"3","key":"182_CR30","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/PL00011648","volume":"2","author":"C Shahabi","year":"2000","unstructured":"Shahabi C, Khan L, McLeod D (2000) A probe-based technique to optimize join queries in distributed internet databases. Knowl Inf Syst 2(3): 373\u2013385","journal-title":"Knowl Inf Syst"},{"key":"182_CR31","unstructured":"Stutzle T (1997) MAX-MIN ant system for the quadratic assignment problem. In: Technical report AIDA-97-4, FG Intellectik, FB Informatik, TU Darmstadt"},{"key":"182_CR32","doi-asserted-by":"crossref","unstructured":"Stutzle T, Dorigo M (1999) ACO algorithms for the quadratic assignment problem, pp 33\u201350","DOI":"10.2307\/3010565"},{"key":"182_CR33","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"E Taillard","year":"1995","unstructured":"Taillard E (1995) Comparison of iterative searches for the quadratic assignment problem. Location Sci 3: 87\u2013105","journal-title":"Location Sci"},{"issue":"3","key":"182_CR34","doi-asserted-by":"crossref","first-page":"231","DOI":"10.3923\/itj.2003.231.239","volume":"2","author":"T Ulus","year":"2003","unstructured":"Ulus T, Uysal M (2003) Heuristic approach to dynamic data allocation in distributed database systems. Pakistan J Inform Technol 2(3): 231\u2013239","journal-title":"Pakistan J Inform Technol"},{"issue":"3","key":"182_CR35","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/s10115-004-0189-y","volume":"8","author":"Q Zhu","year":"2005","unstructured":"Zhu Q, Tao Y, Zuzarte C (2005) Optimizing complex queries based on similarities of subqueries. Knowl Inf Syst 8(3): 350\u2013373","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-008-0182-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-008-0182-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-008-0182-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:18Z","timestamp":1559110218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-008-0182-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,23]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["182"],"URL":"https:\/\/doi.org\/10.1007\/s10115-008-0182-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,23]]}}}