skip to main content
survey

A Comprehensive Taxonomy of Fragmentation and Allocation Techniques in Distributed Database Design

Published:04 January 2018Publication History
Skip Abstract Section

Abstract

The need to design an optimally distributed database is increasingly important with the growth of information technology and computer networks. However, designing a distributed database is an extremely complex process due to a large number of geographically distributed sites and database relations. Moreover, decreasing communication costs and query response time should be taken into consideration. There are three main techniques applied to design a distributed database, namely Fragmentation, Data allocation, and Replication. It is notable that these techniques are often treated separately and rarely processed together. Some available allocation methods are applied regardless of how the fragmentation technique is performed or replication process is adopted. In contrast, other fragmentation techniques do not consider the allocation or the replication techniques. Therefore, the first and foremost step for designing an optimal database is to develop a comprehensive understanding of the current fragmentation, replication, and allocation techniques and their disadvantages. This article presents an attempt to fulfill this step by proposing a comprehensive taxonomy of the available fragmentation and allocation techniques in distributed database design. The article also discusses some case studies of these techniques for a deeper understanding of its achievements and limitations.

References

  1. Hassan I. Abdalla, Ali A. Amer, and Hassan Mathkour. 2014. A novel vertical fragmentation, replication and allocation model in DDBSs. J. Universal Comput. Sci. 20, 10, 1469--1487. DOI:http://www.jucs.org/jucs_20_10/a_novel_vertical_fragmentationGoogle ScholarGoogle Scholar
  2. Hassan I. Abdalla, Ali A. Amer, and Hassan Mathkour. 2013. Performance optimality enhancement algorithm in DDBS (POEA). Computers in Human Behavior 30 (2013), 419--426. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Hassan Abdalla. 2008. Using a greedy-based approach for solving data allocation problem in a distributed environment. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications.Google ScholarGoogle Scholar
  4. Hassan Abdalla. 2011. An efficient approach for data placement in distributed systems. Proceedings of the 5th FTRA International Conference on Multimedia and Ubiquitous Engineering (SAGA). DOI:http://doi.ieeecomputersociety.org/10.1109/MUE.2011.60Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. H. Abdalla and M. AlFares. 2007. An enhanced grouping algorithm for vertical partitioning problem in DDBs. Proceedings of the 22nd International Symposium on Computer and Information Sciences (ISCIS’07).Google ScholarGoogle Scholar
  6. Hassan I. Abdalla. 2014. A synchronized design technique for efficient data distribution. Comput. Human Behav. 30, 427--435. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Eltayeb S. Abuelyaman. 2008. An optimized scheme for vertical partitioning of a distributed database. Int. J. Comput. Sci. Netw. Secur.Google ScholarGoogle Scholar
  8. M. AlFares, H. Abdalla, and F. Marir. 2007. Vertical partitioning for database design: A grouping algorithm. Proceedings of the 16th International Conference on Software Engineering and Data Engineering.Google ScholarGoogle Scholar
  9. Ali A. Amer and Hassan I. Abdalla. 2012. An integrated design scheme for performance optimization in distributed environments. International J. Info. Studies. Retrieved from https://www.researchgate.net/publication/261481109_An_integrated_design_scheme_for_performance_optimization_in_distributed_environments.Google ScholarGoogle Scholar
  10. Hassan I. Abdalla and Ali A. Amer. 2012. Dynamic horizontal fragmentation, replication and allocation model in DDBSs. In Proceedings of the IEEE International Conference On Information Technology and e-Services (ICITeS'12). Google ScholarGoogle ScholarCross RefCross Ref
  11. Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok, and Siu-Kai So. 2002. Evolutionary algorithms for allocating data in distributed database systems. Distrib. Parallel Databases 11, 1, 5--32.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Peter M. G. Apers. 1988. Data allocation in distributed databases. ACM Trans. Database Syst. 13, 3, 263--304. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Serge Abiteboul, Angela Bonifati, Gregory Cobena, Ioana Manolescu, and Tova Milo. 2003. Dynamic XML documents with distribution and replication. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 527--538. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Agrawal, V. Narasayya, and B. Yang. 2004. Integrating vertical and horizontal partitioning into automated physical database design. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 359--370. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. L. Bellatreche, A. Simonet, and M. Simonet. 1996. Vertical fragmentation in distributed object database system with complex attributes and methods. In Proceedings of the 7th International Workshop on Database and Expert Systems Applications, 15--21. DOI:http://dx.doi.org/10.1109/DEXA.1996.558266 Google ScholarGoogle ScholarCross RefCross Ref
  16. Anders Berglund, Scott Boag, Don Chamberlin, Mary F. Fernández, Michael Kay, Jonathan Robie, and Jérôme Siméon. XML path language (xpath), 2.0, 2nd ed., 2010.Google ScholarGoogle Scholar
  17. Rex Blankinship, Alan R. Hevner, and S. Bing Yao. 1991. An iterative method for distributed database design. Proceedings of the 17th International Conference on Very Large Data Bases. 389--400.Google ScholarGoogle Scholar
  18. Anna Brunstroml, Scott T. Leutenegger, and Rahul Simhal. 1995. Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workload. Institute for Computer Applications in Science and Engineering (ICASE).Google ScholarGoogle Scholar
  19. Chun-Hung Cheng, Wing-Kin Lee, and Kam-Fai Wong. 2002. A genetic algorithm-based clustering approach for database partitioning. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 32, 3 (2002), 215--230. DOI:http://dx.doi.org/10.1109/TSMCC.2002.804444 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. T. Chang. 2002. Optimization Approach for Data Allocation in Multidisk Database. European J. Operat. Res. 143, 1, 210--217. DOI:http://dx.doi.org/10.1016/S0377-2217(01)00336-8 Google ScholarGoogle ScholarCross RefCross Ref
  21. Amita Goyal Chin. 2002. Incremental data allocation and reallocation in distributed database systems. Data Warehousing and Web Engineering, IRM Press, Hershey, PA, 137--160.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Amita Goyal Chin. 2001. Incremental data allocation and reallocation in distributed database systems. J. Database Manage. 12, 1, 35--45.Google ScholarGoogle Scholar
  23. Dejan Chandra Gope. 2012. Dynamic data allocation methods in distributed database system. Amer. Acad. Scholar. Res. J. 4, 6.Google ScholarGoogle Scholar
  24. Ge-Ming Chiu and C. S. Raghavendra. 1990. A model for optimal database allocation in distributed computing systems. In Proceedings of the 9th Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM’90). DOI:http://dx.doi.org/10.1109/INFCOM.1990.91328 Google ScholarGoogle ScholarCross RefCross Ref
  25. S. Ceri, B. Pernici, and G. Wiederhold. 1989. Optimization problems and solution methods in the design of data distribution. J. Info. Syst. 14, 3, 261--272. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. S. Ceri and G. Pelagatt. 1984. Distributed Databases Principles and System, 1st ed. McGraw-Hill, Inc. New York, NY.Google ScholarGoogle Scholar
  27. S. Ceri, M. Negri, and G. Pelagatti. 1982. Horizontal data partitioning in database design. Proceedings of the ACM SIGMOD International Conference on Management of Data. 128--136. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. S. Ceri, S. B. Navathe, and G. Wiederhold. 1983. Distribution design of logical database schemas. IEEE Trans. Softw. Eng. 9, 4, 487--504. DOI:http://dx.doi.org/10.1109/TSE.1983.234957 Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. T. Özsu and P. Valduriez. 1999. Principles of Distributed Database Systems, 2nd ed. Prentice Hall, Englewood Cliffs, NJ.Google ScholarGoogle Scholar
  30. Arthur L. Corcoran and John Hale. 1994. A generic algorithm for fragment allocation in distributed database system. In Proceedings of the ACM Symposium on Applied Computing. 247--250.Google ScholarGoogle Scholar
  31. Sharma Chakravarthy, Jaykumar Muthuraj, Ravi Varadarajan, and Shamkant B. Navathe. 1994. An objective function for vertically partitioning relations in distributed databases and its analysis. J. Distrib. Parallel Databases 2, 2, 183--207. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. S. D. C. di Vimercati, S. Foresti, S. Jajodia, G. Livraga, S. Paraboschi, and P. Samarati. 2014. Fragmentation in presence of data dependencies. IEEE Trans. Depend. Secure Comput. 11, 6, 510--523. DOI:http://dx.doi.org/10.1109/TDSC.2013.2295798 Google ScholarGoogle ScholarCross RefCross Ref
  33. W. W. Chu. 1969. Optimal file allocation in multiple computer systems. IEEE Trans. Comput. C-18, 10, 885--889. DOI:http://dx.doi.org/10.1109/T-C.1969.222542 Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Nadeem H. Daudpota.1998. Five steps to construct a model of data allocation for distributed database systems. J. Intell. Info. Syst.: Integrat. Artific. Intell. Database Technol. 11, 2, 153--168. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. L. W. Dowdy and D. V. Foster. 1982. Comparative models of the file assignment problem. ACM Comput. Surveys 14, 2, 287--313. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. C. I. Ezeife and K. Barker. 1995. A comprehensive approach to horizontal class fragmentation in a distributed object based system. Distrib. Parallel Databases 3, 3, 247--272. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. C. I. Ezeife and K. Barker. 1998. Distributed object based design vertical fragmentation of classes. Int. J. Distrib. Parallel Databases. DOI:http://dx.doi.org/10.1023/A:1008666830313Google ScholarGoogle Scholar
  38. A. Singh, K. S. Kahlon, and R. S. Virk. 2014. Nonreplicated static data allocation in distributed databases using biogeography-based optimization. Chinese Journal of Engineering 2014. 1--9. Google ScholarGoogle ScholarCross RefCross Ref
  39. Kapali P. Eswaran. 1974. Placement of records in a file and file allocation in a computer network. In Proceedings of the IFIP Congress on Information Processing. 304--307.Google ScholarGoogle Scholar
  40. Ramez Elmasri and Shamkant B. Navathe. 2010. Fundamentals of database systems. Retrieved from http://www.amazon.com/Fundamentals-Database-Systems-6th-Edition/dp/0136086209.Google ScholarGoogle Scholar
  41. Rachid Elmansoud, Elhoussaine Ziyati, Omar Elbeqqali, and Driss Aboutajdine. 2012. The fragmentation of data warehouses: An approach based on principal components analysis. In Proceedings of the International Conference on Multimedia Computing and Systems (ICMCS’12). 18--23. DOI:http://dx.doi.org/10.1109/ICMCS.2012.6320319 Google ScholarGoogle ScholarCross RefCross Ref
  42. Herb Edelstein. 1995. The challenge of replication. DBMS 8, 4, 62--70.Google ScholarGoogle Scholar
  43. H. Grebla, G. Moldovan, S. A. Darabant, and A. Câmpan. 2004. Data allocation in distributed database systems performed by mobile intelligent agents. In Proceedings of the International Conference on Theory and Applications of Mathematics and Informatics (ICTAMI’04).Google ScholarGoogle Scholar
  44. Narasimhaiah Gorla, Vincent Ng, and Dik Man Law. 2012. Improving database performance with a mixed fragmentation design. J. Intell. Info. Syst. 39, 3, 559--576. Google ScholarGoogle ScholarCross RefCross Ref
  45. Ismail O. Hababeh. 2007. A method for fragment allocation design in the distributed database systems. In Proceedings of the 6th Annual U.A.E. University Research Conference.Google ScholarGoogle Scholar
  46. Ismail O. Hababeh, Muthu Ramachandran, and Nicholas Bowring. 2007. A high-performance computing method for data allocation in distributed database systems. J. Supercomput. 39, 1, 3--18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Ismail O. Hababeh, N. Bowring, and M. Ramachandran. 2003. An integrated strategy for data fragmentation and allocation in a distributed database design. In Proceedings of the International Conference on Information Technology and Natural Science (ICITNS’03).Google ScholarGoogle Scholar
  48. J. O. Hauglid and N. H. Ryeng. 2010. DYFRAM: Dynamic fragmentation and replica management in distributed database systems. Distrib. Parallel Databases 28, 157--185. DOI:http://dx.doi.org/10.1007/s10619-010-7068-1 Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. S. Harikumar and R. Ramachandran. 2015. Hybridized fragmentation of very large databases using clustering. In Proceedings of the 2015 IEEE International Conference on Signal Processing, Informatics, Communication, and Energy Systems (SPICES’15). IEEE. 1--5. Google ScholarGoogle ScholarCross RefCross Ref
  50. Yin-Fu Huang and Jyh-Her Chen. 2001. Fragment allocation in distributed database design. J. Info. Sci. Eng. Retrieved from http://www.iis.sinica.edu.tw/page/jise/2001/200105_08.pdf.Google ScholarGoogle Scholar
  51. Nicoleta Iacob. 2010. Data replication in distributed environments. Annals of the Constantin Brâncuşi. University of Târgu Jiu, Economy Series, Issue 4. Retrieved from https://www.researchgate.net/publication/227382838_Data_replication_in_distributed_environments.Google ScholarGoogle Scholar
  52. N. Khalil, D. Eid, and Khair Marie. 1999. Availability and reliability issues in database and expert system applications. Proceedings of the 10th International Conference on Database and Expert Systems Applications. 771--780. Google ScholarGoogle ScholarCross RefCross Ref
  53. Shahidul Islam Khan and Dr. A. S. M. LatifulHoque. 2010. A new technique for database fragmentation in distributed systems. Int. J. Comput. Appl. 9, 5.Google ScholarGoogle Scholar
  54. Annamaria V. Kish, John R. Rose, and CsillaFarkas. 2014. Efficient partitioning and allocation of data for workload queries. Proceedings of the 9th Annual International Joint Conferences on Computer, Information, Systems Sciences, 8 Engineering (CISSE’14).Google ScholarGoogle Scholar
  55. Kamalaakar Karlapalem, Shamkant Navathe, and MagdiMorsi. 1994. Issues in distribution design of object oriented databases. Distributed Object Management. Morgan Kaufmann Publishers.Google ScholarGoogle Scholar
  56. A. Mahmood H. U. Khan and H. A. Fatmi. 1994. Adaptive file allocation in distributed computer systems. Distrib. Syst. Eng. Retrieved from http://iopscience.iop.org/article/10.1088/0967-1846/1/6/004/pdf.Google ScholarGoogle Scholar
  57. Mohamed Kechar and Safia Nait Bahloul. 2014. Hybrid fragmentation of XML data warehouse using k-means algorithm. Adv. Databases Info. Syst. Volume 8716 of the series Lecture Notes in Computer Science, 70--82. Google ScholarGoogle ScholarCross RefCross Ref
  58. R. KarimiAdl and S. M. T. Rouhani Rankoohi. 2009. A new ant colony optimization based algorithm for data allocation problem in distributed databases. Knowl. Info. Syst. 20, 3, 349--373. Google ScholarGoogle ScholarDigital LibraryDigital Library
  59. H. Lee, Y.-K. Park, G. Jang, and S.-Y. Huh. 2000. Designing a distributed database on a local area network: A methodology and decision support system. Info. Software Technol. 42, 3, 171--184. Google ScholarGoogle ScholarCross RefCross Ref
  60. Shun-Pun Li and Man-Hon Wong. 2013. Data allocation in scalable distributed database systems based on time series forecasting big data (BigData Congress). In Proceedings of the IEEE International Congress. 17--24. DOI:http://dx.doi.org/10.1109/BigData.Congress.2013.12 Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. Xuemin Lin, M. Orlowska, and Yanchun Zhang. 1993. On data allocation with the minimum overall communication costs in distributed database design. In Proceedings of the 5th International Conference on Computing and Information.Google ScholarGoogle Scholar
  62. Van Nghia Luong, Ha HuyCuong Nguyen, and Van Son Le. 2015. An improvement on fragmentation in distribution database design based on knowledge-oriented clustering techniques. Int. J. Comput. Sci. Info. Secur. 13, 5.Google ScholarGoogle Scholar
  63. Wujuan Lin and B. Veeravalli. 2003. An adaptive object allocation and replication algorithm in distributed databases. In Proceedings of the 23rd International Conference on Distributed Computing Systems. DOI:http://dx.doi.org/10.1109/ICDCSW.2003.1203544 Google ScholarGoogle ScholarCross RefCross Ref
  64. A. Mei, L. Mancini, and S. Jajodia. 2003. Secure dynamic fragment and replica allocation in large-scale distributed file systems. IEEE Trans. Parallel Distrib. Syst. 14, 9, 885--896. DOI:http://dx.doi.org/10.1109/TPDS.2003.1233711 Google ScholarGoogle ScholarDigital LibraryDigital Library
  65. Hui Ma and Markus Kirchberg. 2007. Cost-based fragmentation for distributed complex value databases. In Proceedings of the 26th International Conference on Conceptual Modeling. 72--86. Google ScholarGoogle ScholarCross RefCross Ref
  66. Hui Ma, K. D. Schewe, and M. Kirchberg. 2007. A heuristic approach to vertical fragmentation incorporating query information. In Proceedings of the 7th International Baltic Conference on Databases and Information Systems (DB&IS’’07). 69--76. DOI:http://dx.doi.org/10.1109/DBIS.2006.1678477 Google ScholarGoogle ScholarCross RefCross Ref
  67. Hui Ma, Klaus-Dieter Schewe, and Qing Wang. 2006. A heuristic approach to cost-efficient fragmentation and allocation of complex value databases. In Proceedings of the 17th Australasian Database Conference, vol. 49. 183--192.Google ScholarGoogle Scholar
  68. Hadj Mahboubi and Jérôme Darmont. 2009. Enhancing XML data warehouse query performance by fragmentation. Proceedings of the 24th Annual ACM Symposium on Applied Computing (SAC’09). Google ScholarGoogle ScholarDigital LibraryDigital Library
  69. Nilarun Mukherjee. 2010. Synthesis of non-replicated dynamic fragment allocation algorithm in distributed database systems. ACEEE Int. J. Info. Technol. 01, No. 01. Retrieved from http://searchdl.org/public/journals/2011/IJIT/1/1/98.pdf.Google ScholarGoogle Scholar
  70. M. Ra. 1983. Horizontal partitioning for distributed database design. In Advances in Database Research, M.orlowska and M. Papazog lou (Eds.) World Scientific Publishing, 101--120.Google ScholarGoogle Scholar
  71. Syam Menon. 2005. Allocating fragments in distributed databases. IEEE Trans. Parallel Distrib. Syst. 16, 7, 577--585. DOI:http://dx.doi.org/10.1109/TPDS.2005.77 Google ScholarGoogle ScholarDigital LibraryDigital Library
  72. S. T. March and S. Rho, 1995. Allocating data and operations to nodes in distributed database design. IEEE Trans. Knowl. Data Eng. 7, 2, 305--317. DOI:http://dx.doi.org/10.1109/69.382299 Google ScholarGoogle ScholarDigital LibraryDigital Library
  73. Salvatore T. March. 1983. Techniques for structuring database records. ACM Comput. Surveys 15, 1, 45--79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  74. S. Navathe, S. Ceri, G. Wiederhold, and J. Dou. 1984. Vertical partitioning algorithms for database design. ACM Trans. Database Syst. 9, 4, 680--710. Google ScholarGoogle ScholarDigital LibraryDigital Library
  75. Shamkant B. Navathe and Mingyoung Ra. 1989. Vertical partitioning for database design: A graphical algorithm. Proceedings of the ACM SIGMOD International Conference on Management of Data. 440--450. Google ScholarGoogle ScholarDigital LibraryDigital Library
  76. Shamkant B. Navathe, Kamalakar Karlapalem, and Minyoung Ra. 1995. A mixed fragmentation methodology for initial distributed database design. Technical Report No. 90-17, CIS Department, University of Florida, Gainesville, FL.Google ScholarGoogle Scholar
  77. Rodolfo A. Pazos, Graciela Vázquez, José A. Martínez, Joaquín Pérez-Ortega, and Gilberto Martínez-Luna. 2014. Minimizing roundtrip response time in distributed databases with vertical fragmentation. J. Comput. Appl. Math. 259, part B, 905--913.Google ScholarGoogle ScholarDigital LibraryDigital Library
  78. Saeed K. Rahimi and Frank S. Haug. 2010. Distributed Database Management Systems. John Wiley 8 Sons, Inc., IEEE Computer Society. Google ScholarGoogle ScholarCross RefCross Ref
  79. M. Ra. 1993. Horizontal partitioning for distributed database design. In Advances in Database Research. World Scientific Publishing, 101--120.Google ScholarGoogle Scholar
  80. C. V. Ramamoorthy and B. W. Wah. 1979. The placement of relations on a distributed relational database. In Proceedings of the 1st Conference on Distributed Computing System.Google ScholarGoogle Scholar
  81. P. I. Rivera-Vega, R. Varadarajan, and S. B. Navathe. 1990. February. scheduling data redistribution in distributed databases. In Proceedings of the 6th International Conference on Data Enginering. IEEE, 166--173.Google ScholarGoogle Scholar
  82. Arjan Singh and K. S. Kahlon. 2009. Non-replicated dynamic data allocation in distributed database systems. Int. J. Comput. Sci. Network Security 9, 9. Retrieved from http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.512.2367&rep==rep1&type==pdf.Google ScholarGoogle Scholar
  83. Abraham Silberschatz, Henry F. Korth, and S. Sudarshan. 2005. Database System Concept, 5th ed. Retrieved from http://codex.cs.yale.edu/avi/db-book/db5/slide-dir/.Google ScholarGoogle Scholar
  84. M. Sipos, F. H. Fitzek, D. E. Lucani, and M. V. Pedersen. 2014. Dynamic allocation and efficient distribution of data among multiple. In Proceedings of the IEEE 3rd International Conference on Clouds Using Network Coding, Cloud Networking (CloudNet’14). 90--95. DOI:http://dx.doi.org/10.1109/CloudNet.2014.6968974 Google ScholarGoogle ScholarCross RefCross Ref
  85. Y. Lee Shi and J. Stolen. 1994. Allocating data files over a wide area network: Goal setting and compromise design. Info. Manage. 26, 2, 85--93. Google ScholarGoogle ScholarDigital LibraryDigital Library
  86. P. Surmsuk and S. Thanawastien. 2007. The integrated strategic information system planning methodology. In Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC’07). IEEE, 467--467. Google ScholarGoogle ScholarCross RefCross Ref
  87. A. Tamhankar and S. Ram. 1998. Database fragmentation and allocation: An integrated methodology and case study. IEEE Trans. Syst. Man Cybernet. Part A: Syst. Hum. 28, 288--305. DOI:http://dx.doi.org/10.1109/3468.668961 Google ScholarGoogle ScholarDigital LibraryDigital Library
  88. Leon Tâmbulea and Manuela Horvat. 2008. Dynamic distribution model in distributed database. Int. J. Comput. Commun. Control Suppl. 3, 3, 512--515.Google ScholarGoogle Scholar
  89. Gustavo Tonini and Frank Siqueira. 2013. A distributed data allocation algorithm for biological databases. In Proceedings of the IEEE 16th International Conference Computational Science and Engineering (CSE’13). 531--537. DOI:http://dx.doi.org/10.1109/CSE.2013.85 Google ScholarGoogle ScholarDigital LibraryDigital Library
  90. M. Tamer Ozsu and Patrick Valduriez. 2011. Principles of Distributed Database Systems, 3rd ed. Prentice-Hall, New Jersey.Google ScholarGoogle Scholar
  91. Toadere Teodor. 2002. Graphs. Theory, Algorithms and Applications. Editura Albastra.Google ScholarGoogle Scholar
  92. Schita Upadhyaya and Suman Lat. 2008. Task allocation in distributed computing vs distributed database systems: A comparative study. Int. J. Comput. Sci. Netw. Secur. Retrieved from https://www.researchgate.net/publication/255588717_Task_allocation_in_Distributed_computing_VS_distributed_database_systems__A_Comparative_study.Google ScholarGoogle Scholar
  93. T. Ulus and M. Uysal. 2007. A threshold based dynamic data allocation algorithm: A Markov chain model approach. J. Appl. Sci. 7, 2, 165--174. Retrieved from http://adsabs.harvard.edu/abs/2007JApSc...7..165U. Google ScholarGoogle ScholarCross RefCross Ref
  94. T. Ulus and M. Uysal. 2003. Heuristic approach to dynamic data allocation in distributed database systems. Pakistan J. Info. Technol. DOI:http://dx.doi.org/10.3923/itj.2003.231.239 Google ScholarGoogle ScholarCross RefCross Ref
  95. Jeffrey L. Whitten and Lonnie D. Bentley. 2005. Systems Analysis and Design Methods, 6th ed. McGraw-Hill.Google ScholarGoogle Scholar
  96. O. Wolfson and S. Jajodia. 1992. An algorithm for dynamic data distribution. In Proceedings of the 2nd Workshop on the Management of Replicated Data (WMRD’92). 62--65. DOI:http://dx.doi.org/10.1109/MRD.1992.242616 Google ScholarGoogle ScholarCross RefCross Ref
  97. O. Wolfson, S. Jajodia, and Y. Huang. 1997. An adaptive data replication algorithm. ACM Trans. Database Syst. 22, 2, 255--314. Google ScholarGoogle ScholarDigital LibraryDigital Library
  98. Lena Wiese. 2014. Clustering-based fragmentation and data replication for flexible query answering in distributed databases. Wiese J. Cloud Computing: Advances, Systems and Applications. 3:18. Retrieved from http://link.springer.com/article/10.1186%2Fs13677-014-0018-0.Google ScholarGoogle ScholarCross RefCross Ref
  99. Yanchun Zhang and Maria E. Orlowska. 1994. On fragmentation approaches for distributed database design. Info. Sci. Appl. 1, 3, 117--132. Google ScholarGoogle ScholarCross RefCross Ref
  100. Y. Zhang. 1993. On horizontal fragmentation of distributed database design. In Advances in Database Research, M. Orlowska and M. Papazoglou (Eds.). World Scientific Publishing, Singapore, pp. 121--130.Google ScholarGoogle Scholar
  101. I. Ahmad, K. Karlapalem, Y. K. Kwok, and S. K. So. 2002. Evolutionary algorithms for allocating data in distributed database systems. Distrib. Parallel Databases 11, 1, 5--32. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A Comprehensive Taxonomy of Fragmentation and Allocation Techniques in Distributed Database Design

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Computing Surveys
      ACM Computing Surveys  Volume 51, Issue 1
      January 2019
      743 pages
      ISSN:0360-0300
      EISSN:1557-7341
      DOI:10.1145/3177787
      • Editor:
      • Sartaj Sahni
      Issue’s Table of Contents

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 4 January 2018
      • Accepted: 1 October 2017
      • Revised: 1 April 2017
      • Received: 1 December 2015
      Published in csur Volume 51, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • survey
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader