{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:27:46Z","timestamp":1764332866688,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T00:00:00Z","timestamp":1589155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T00:00:00Z","timestamp":1589155200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In Distributed Database Systems (DDBS), communication costs and response time have long been open-ended challenges. Nevertheless, when DDBS is carefully designed, the desired reduction in communication costs will be achieved. Data fragmentation (data clustering) and data allocation are on popularity as the prime strategies in constant use to design DDBS. Based on these strategies, on the other hand, several design techniques have been presented in the literature to improve DDBS performance using either empirical results or data statistics, making most of them imperfect or invalid particularly, at least, at the initial stage of DDBSs design. In this paper, thus, a heuristic k-means approach for vertical fragmentation and allocation is introduced. This approach is primarily focused on DDBS design at the initial stage. Many techniques are being joined in a step to make a promising work. A brief yet effective experimental study, on both artificially-created and real datasets, has been conducted to demonstrate the optimality of the proposed approach, comparing with its counterparts, as the obtained results has been shown encouraging.<\/jats:p>","DOI":"10.1186\/s40537-020-00306-9","type":"journal-article","created":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T13:02:55Z","timestamp":1589202175000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On K-means clustering-based approach for DDBSs design"],"prefix":"10.1186","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2002-948X","authenticated-orcid":false,"given":"Ali A.","family":"Amer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,11]]},"reference":[{"issue":"1","key":"306_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3150223","volume":"51","author":"D Nashat","year":"2018","unstructured":"Nashat D, Amer A. A comprehensive taxonomy of fragmentation and allocation techniques in distributed database design. ACM Comput Surv. 2018;51(1):1\u201325.","journal-title":"ACM Comput Surv"},{"key":"306_CR2","doi-asserted-by":"crossref","unstructured":"Hui M, Schewe K, Kirchberg M (2006). A heuristic approach to vertical fragmentation incorporating query information. 7th International Baltic Conference on Databases and Information Systems.","DOI":"10.1109\/DBIS.2006.1678477"},{"key":"306_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-019-1787-3","author":"N Lotfi","year":"2019","unstructured":"Lotfi N. Data allocation in Distributed Database Systems: a novel hybrid method based on differential evolution and variable neighborhood search. SN Appl Sci. 2019. https:\/\/doi.org\/10.1007\/s42452-019-1787-3.","journal-title":"SN Appl Sci"},{"issue":"3","key":"306_CR4","first-page":"308","volume":"60","author":"L Wiese","year":"2016","unstructured":"Wiese L, Waage T, Bollwein F. A replication scheme for multiple fragmentations with overlapping fragments. Comput J. 2016;60(3):308\u201328.","journal-title":"Comput J."},{"key":"306_CR5","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 O, Kodaz H. A new approach based on particle swarm optimization algorithm for solving data allocation problem. Appl Soft Comput. 2018;62:571\u20138.","journal-title":"Appl Soft Comput"},{"issue":"2","key":"306_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.4018\/IJSWIS.2017040103","volume":"13","author":"A Sewisy","year":"2017","unstructured":"Sewisy A, Amer A, Abdalla H. A novel query-driven clustering-based technique for vertical fragmentation and allocation in Distributed Database Systems. Int J Semant Web Inf Syst. 2017;13(2):27\u201354.","journal-title":"Int J Semant Web Inf Syst"},{"key":"306_CR7","doi-asserted-by":"publisher","first-page":"134","DOI":"10.4018\/978-1-5225-7186-5.ch006","volume-title":"Semantic web science and real-world applications","author":"A Amer","year":"2019","unstructured":"Amer A. Data replication impact on DDBS system performance. In: Lytras SM, Aljohani N, Damiani E, Chui K, editors. Semantic web science and real-world applications. 1st ed. Pennsylvania: IGI Global; 2019. p. 134\u201362.","edition":"1"},{"key":"306_CR8","doi-asserted-by":"crossref","unstructured":"Amer A, Mohamed M, Al-Asri K (2018). On an effective hierarchical clustering based model for data fragmentation and allocation in relational DDBS: review and proposal. In: Proceedings of ACM ICCES conference, Kuala Lumpur, Malaysia, July 14\u201316, (ICCES \u201818).","DOI":"10.1145\/3213187.3293604"},{"issue":"3","key":"306_CR9","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3390\/info10030112","volume":"10","author":"H Abdalla","year":"2019","unstructured":"Abdalla H, Artoli A. Towards an efficient data fragmentation, allocation, and clustering approach in a distributed environment. Information. 2019;10(3):112.","journal-title":"Information"},{"key":"306_CR10","doi-asserted-by":"crossref","unstructured":"Torshiz M, Esfaji A, Amintoosi H. Enhanced schemes for data fragmentation, allocation, and replication in Distributed Database Systems. Int J Comput Syst Sci Eng. 2020;35(2).","DOI":"10.32604\/csse.2020.35.099"},{"key":"306_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2018.09.020","author":"S Mehta","year":"2018","unstructured":"Mehta S, Agarwal P, Shrivastava P, Barlawala J. Differential bond energy algorithm for optimal vertical fragmentation of distributed databases. J King Saud Univ Comput Inform Sci. 2018. https:\/\/doi.org\/10.1016\/j.jksuci.2018.09.020.","journal-title":"J King Saud Univ Comput Inform Sci"},{"key":"306_CR12","doi-asserted-by":"crossref","unstructured":"Zar Lwin NK, Naing TM (2018). Non-redundant dynamic fragment allocation with horizontal partition in Distributed Database System. In: International conference on intelligent informatics and biomedical sciences (ICIIBMS), Bangkok, p. 300\u2013305.","DOI":"10.1109\/ICIIBMS.2018.8550032"},{"issue":"13","key":"306_CR13","doi-asserted-by":"publisher","first-page":"e4416","DOI":"10.1002\/cpe.4416","volume":"30","author":"A Abdel Raouf","year":"2018","unstructured":"Abdel Raouf A, Badr N, Tolba M. Dynamic data reallocation and replication over a cloud environment. Concurr Comput. 2018;30(13):e4416.","journal-title":"Concurr Comput"},{"issue":"4","key":"306_CR14","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1134\/S0005117919040143","volume":"80","author":"S Somov","year":"2019","unstructured":"Somov S. Creation of information-technological reserve in Distributed Data Processing Systems. Autom Remote Control. 2019;80(4):781\u201390.","journal-title":"Autom Remote Control"},{"issue":"1","key":"306_CR15","doi-asserted-by":"publisher","first-page":"e03172","DOI":"10.1016\/j.heliyon.2020.e03172","volume":"6","author":"A Amer","year":"2020","unstructured":"Amer A, Mohamed M, Al-Asri K. ASGOP: an aggregated similarity-based greedy-oriented approach for relational DDBSs design. Heliyon. 2020;6(1):e03172.","journal-title":"Heliyon."},{"key":"306_CR16","volume-title":"Algorithms for clustering data","author":"A Jain","year":"1988","unstructured":"Jain A, Dubes R. Algorithms for clustering data. Englewood Cliffs: Prentice Hall; 1988."},{"key":"306_CR17","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ins.2015.03.062","volume":"320","author":"S Zahra","year":"2015","unstructured":"Zahra S, Ghazanfar MA, Khalid A, Azam MA, Naeem U, Prugel-Bennett A. Novel centroid selection approaches for K-means-clustering based recommender systems. Inf Sci. 2015;320:156\u201389.","journal-title":"Inf Sci"},{"key":"306_CR18","volume-title":"Smart computing and informatics. Smart Innovation, Systems and Technologies","author":"N Sandhya","year":"2018","unstructured":"Sandhya N, Raja Sekar M. Analysis of variant approaches for initial centroid selection in K-means clustering algorithm. In: Satapathy S, Bhateja V, Das S, editors. Smart computing and informatics. Smart Innovation, Systems and Technologies, vol. 78. Singapore: Springer; 2018."},{"issue":"2","key":"306_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R Hamming","year":"1950","unstructured":"Hamming R. Error detecting and error correcting codes. Bell Syst Tech J. 1950;29(2):147\u201360.","journal-title":"Bell Syst Tech J"},{"issue":"1","key":"306_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H Koga","year":"2006","unstructured":"Koga H, Ishibashi T, Watanabe T. Fast agglomerative hierarchical clustering algorithm using locality-sensitive hashing. Knowl Inf Syst. 2006;12(1):25\u201353.","journal-title":"Knowl Inf Syst"},{"issue":"12","key":"306_CR21","doi-asserted-by":"publisher","first-page":"e00487","DOI":"10.1016\/j.heliyon.2017.e00487","volume":"3","author":"A Amer","year":"2017","unstructured":"Amer A, Sewisy A, Elgendy T. An optimized approach for simultaneous horizontal data fragmentation and allocation in Distributed Database Systems (DDBSs). Heliyon. 2017;3(12):e00487.","journal-title":"Heliyon"},{"key":"306_CR22","unstructured":"UCI. (1999). Machine learning repository content summary. Retrieved March 4, 2020, from http:\/\/www.ics.uci.edu\/~mlearn\/MLSummary.html."},{"key":"306_CR23","doi-asserted-by":"crossref","unstructured":"Amer A, Abdalla H. (2012). A heuristic approach to re-allocate data fragments in DDBSs. Information Technology and e- Services (ICITeS), International Conference on IEEE.","DOI":"10.1109\/ICITeS.2012.6216621"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-020-00306-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-020-00306-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-020-00306-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T12:16:46Z","timestamp":1666527406000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-020-00306-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,11]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["306"],"URL":"https:\/\/doi.org\/10.1186\/s40537-020-00306-9","relation":{},"ISSN":["2196-1115"],"issn-type":[{"type":"electronic","value":"2196-1115"}],"subject":[],"published":{"date-parts":[[2020,5,11]]},"assertion":[{"value":"12 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"31"}}