{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:31:15Z","timestamp":1759969875530,"version":"build-2065373602"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T00:00:00Z","timestamp":1715817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T00:00:00Z","timestamp":1715817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Technol Manag"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10799-024-00425-2","type":"journal-article","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T12:02:06Z","timestamp":1715860926000},"page":"559-572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Column generation-based algorithm for fragment allocation: minimizing query splitting in distributed databases"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9538-1245","authenticated-orcid":false,"given":"Ali","family":"Amiri","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,16]]},"reference":[{"issue":"2","key":"425_CR1","first-page":"45","volume":"5","author":"HI Abdalla","year":"2012","unstructured":"Abdalla HI (2012) A new data re-allocation model for distributed database systems. Int J Database Theory Appl 5(2):45\u201360","journal-title":"Int J Database Theory Appl"},{"key":"425_CR2","unstructured":"Abdalla HI, Tounsi M, Marir F (2008) Using a greedy-based approach for solving data allocation problem in a distributed environment. In: 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008, pp 975\u2013980"},{"issue":"3","key":"425_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/TSMCC.2002.804444","volume":"32","author":"CH Cheng","year":"2002","unstructured":"Cheng CH, Lee WK, Wong KF (2002) A genetic algorithm-based clustering approach for database partitioning. IEEE Trans Syst Man Cybern Part C Appl Rev 32(3):215\u2013230. https:\/\/doi.org\/10.1109\/TSMCC.2002.804444","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"issue":"3","key":"425_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3452741","volume":"17","author":"A Chikhaoui","year":"2021","unstructured":"Chikhaoui A, Lemarchand L, Boukhalfa K, Boukhobza J (2021) Multi-objective Optimization of Data Placement in a Storage-as-a-Service Federated Cloud. ACM Trans Storage 17(3):1\u201332","journal-title":"ACM Trans Storage"},{"issue":"1","key":"425_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8(1):101\u2013111","journal-title":"Oper Res"},{"issue":"3","key":"425_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey M, Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theoret Comput Sci 1(3):237\u2013267","journal-title":"Theoret Comput Sci"},{"key":"425_CR7","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.ins.2022.09.003","volume":"612","author":"YF Ge","year":"2022","unstructured":"Ge YF, Zhan ZH, Cao J, Wang H, Zhang Y, Lai KK, Zhang J (2022) DSGA: a distributed segment-based genetic algorithm for multi-objective outsourced database partitioning. Inf Sci 612:864\u2013886","journal-title":"Inf Sci"},{"issue":"6","key":"425_CR8","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper Res 9(6):849\u2013859","journal-title":"Oper Res"},{"key":"425_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P Gilmore","year":"1963","unstructured":"Gilmore P, Gomory P (1963) A linear programming approach to the cutting stock problem\u2014Part II. Oper Res 11:863\u2013888","journal-title":"Oper Res"},{"key":"425_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11227-006-0001-8","volume":"39","author":"IO Hababeh","year":"2007","unstructured":"Hababeh IO, Ramachandran M, Bowring N (2007) A high-performance computing method for data allocation in distributed database systems. J Supercomput 39:3\u201318","journal-title":"J Supercomput"},{"key":"425_CR11","doi-asserted-by":"crossref","unstructured":"Halfpap S, Schlosser R (2019) Workload-driven fragment allocation for partially replicated databases using linear programming. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 1746\u20131749","DOI":"10.1109\/ICDE.2019.00188"},{"key":"425_CR12","unstructured":"IBM (2021) IBM ILOG CPLEX Optimization Studio 20.1"},{"key":"425_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10115-008-0182-y","volume":"20","author":"AR Karimi","year":"2009","unstructured":"Karimi AR, Rouhani Rankoohi SMT (2009) A new ant colony optimization-based algorithm for data allocation problem in distributed databases. Knowl Inf Syst 20:349\u2013373","journal-title":"Knowl Inf Syst"},{"key":"425_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp R (1972) Reducibility among combinatorial problems. In: Miller E, Thatcher JW (eds) Complexity of Computer Computations. Springer, Boston, pp 85\u2013103. https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"425_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00778-021-00676-3","volume":"31","author":"J Kossmann","year":"2022","unstructured":"Kossmann J, Papenbrock T, Naumann F (2022) Data dependencies for query optimization: a survey. VLDB J 31(1):1\u201322","journal-title":"VLDB J"},{"issue":"2","key":"425_CR16","first-page":"184","volume":"86","author":"N Lotfi","year":"2021","unstructured":"Lotfi N, Tamouk J (2021) A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS. Comput Sci J Mold 86(2):184\u2013205","journal-title":"Comput Sci J Mold"},{"issue":"12","key":"425_CR17","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1007\/s42452-019-1787-3","volume":"1","author":"N Lotfi","year":"2019","unstructured":"Lotfi N (2019) Data allocation in distributed database systems: a novel hybrid method based on differential evolution and variable neighborhood search. SN Appl Sci 1(12):1724","journal-title":"SN Appl Sci"},{"issue":"6","key":"425_CR18","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper Res 53(6):1007\u20131023","journal-title":"Oper Res"},{"key":"425_CR19","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.asoc.2017.11.019","volume":"62","author":"M Mahi","year":"2018","unstructured":"Mahi M, Baykan OK, Kodaz H (2018) A new approach based on particle swarm optimization algorithm for solving data allocation problem. Appl Soft Comput 62:571\u2013578","journal-title":"Appl Soft Comput"},{"issue":"4","key":"425_CR20","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A Mehrotra","year":"1996","unstructured":"Mehrotra A, Trick MA (1996) A column generation approach for graph coloring. Informs J Comput 8(4):344\u2013354","journal-title":"Informs J Comput"},{"issue":"7","key":"425_CR21","doi-asserted-by":"publisher","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":"425_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3150223","volume":"51","author":"D Nashat","year":"2018","unstructured":"Nashat D, Amer AA (2018) A comprehensive taxonomy of fragmentation and allocation techniques in distributed database design. ACM Comput Surv 51(1):1\u201325","journal-title":"ACM Comput Surv"},{"issue":"1","key":"425_CR23","first-page":"47","volume":"5","author":"N Semmler","year":"2019","unstructured":"Semmler N, Smaragdakis G, Feldmann A (2019) Online replication strategies for distributed data stores. Open J Internet Things 5(1):47\u201357","journal-title":"Open J Internet Things"},{"issue":"9","key":"425_CR24","first-page":"176","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A, Kahlon KS (2009) Non-replicated dynamic data allocation in distributed database systems. IJCSNS Int J Comput Sci Netw Secur 9(9):176\u2013180","journal-title":"IJCSNS Int J Comput Sci Netw Secur"},{"key":"425_CR25","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10844-013-0269-0","volume":"45","author":"S Song","year":"2015","unstructured":"Song S (2015) Design of distributed database systems: an iterative genetic algorithm. J Intell Inf Syst 45:29\u201359","journal-title":"J Intell Inf Syst"},{"issue":"3","key":"425_CR26","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/3468.668961","volume":"28","author":"AM Tamhankar","year":"1998","unstructured":"Tamhankar AM, Ram S (1998) Database fragmentation and allocation: an integrated methodology and case study. IEEE Trans Syst Man Cybern A Syst Hum 28(3):288\u2013305","journal-title":"IEEE Trans Syst Man Cybern A Syst Hum"},{"issue":"6","key":"425_CR27","doi-asserted-by":"publisher","first-page":"6373","DOI":"10.11591\/ijece.v12i6.pp6373-6386","volume":"12","author":"S Tarun","year":"2022","unstructured":"Tarun S, Dubey MK, Batth RS, Kaur S (2022) An optimized cost-based data allocation model for heterogeneous distributed computing systems. Int J Electr Comput Eng 12(6):6373. https:\/\/doi.org\/10.11591\/ijece.v12i6.pp6373-6386","journal-title":"Int J Electr Comput Eng"},{"issue":"3","key":"425_CR28","first-page":"338","volume":"8","author":"S Upadhyaya","year":"2008","unstructured":"Upadhyaya S, Lata S (2008) Task allocation in Distributed computing VS distributed database systems: a Comparative study. Int J Comput Sci Netw Secur 8(3):338\u2013346","journal-title":"Int J Comput Sci Netw Secur"},{"issue":"3","key":"425_CR29","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"P Vance","year":"1998","unstructured":"Vance P (1998) Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput Optim Appl 9(3):211\u2013228","journal-title":"Comput Optim Appl"},{"issue":"4","key":"425_CR30","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F Vanderbeck","year":"1996","unstructured":"Vanderbeck F, Wolsey LA (1996) An exact algorithm for IP column generation. Oper Res Lett 19(4):151\u2013159","journal-title":"Oper Res Lett"}],"container-title":["Information Technology and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10799-024-00425-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10799-024-00425-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10799-024-00425-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T08:23:20Z","timestamp":1759911800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10799-024-00425-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,16]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s10799-024-00425-2","relation":{},"ISSN":["1385-951X","1573-7667"],"issn-type":[{"type":"print","value":"1385-951X"},{"type":"electronic","value":"1573-7667"}],"subject":[],"published":{"date-parts":[[2024,5,16]]},"assertion":[{"value":"2 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article. The author is a member of the Editorial Board of ITEM.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}