CFP last date
20 May 2024
Reseach Article

A New Technique for Database Fragmentation in Distributed Systems

by Dr. A. S. M. Latiful Hoque, Shahidul Islam Khan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 5 - Number 9
Year of Publication: 2010
Authors: Dr. A. S. M. Latiful Hoque, Shahidul Islam Khan
10.5120/940-1318

Dr. A. S. M. Latiful Hoque, Shahidul Islam Khan . A New Technique for Database Fragmentation in Distributed Systems. International Journal of Computer Applications. 5, 9 ( August 2010), 20-24. DOI=10.5120/940-1318

@article{ 10.5120/940-1318,
author = { Dr. A. S. M. Latiful Hoque, Shahidul Islam Khan },
title = { A New Technique for Database Fragmentation in Distributed Systems },
journal = { International Journal of Computer Applications },
issue_date = { August 2010 },
volume = { 5 },
number = { 9 },
month = { August },
year = { 2010 },
issn = { 0975-8887 },
pages = { 20-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume5/number9/940-1318/ },
doi = { 10.5120/940-1318 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:53:49.238535+05:30
%A Dr. A. S. M. Latiful Hoque
%A Shahidul Islam Khan
%T A New Technique for Database Fragmentation in Distributed Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 5
%N 9
%P 20-24
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Improving the performance of a database system is one of the key research issues now a day. Distributed processing is an effective way to improve reliability and performance of a database system. Distribution of data is a collection of fragmentation, allocation and replication processes. Previous research works provided fragmentation solution based on empirical data about the type and frequency of the queries submitted to a centralized system. These solutions are not suitable at the initial stage of a database design for a distributed system. In this paper we have presented a fragmentation technique that can be applied at the initial stage as well as in later stages of a distributed database system for partitioning the relations. Allocation of fragments is done simultaneously in our algorithm. Result shows that proposed technique can solve initial fragmentation problem of relational databases for distributed systems properly.

References
  1. M. T. Ozsu and P. Valduriez, Principles of Distributed Database Systems, 2nd ed., New Jersey: Prentice-Hall, 1999.
  2. S. Ceri and G. Pelagatti, Distributed Databases Principles and System, 1st ed., New York: McGraw-Hill, 1984.
  3. S. Navathe, K. Karlapalem, and M. Ra, “A mixed fragmentation methodology for initial distributed database design,” Journal of Computer and Software Engineering Vol. 3, No. 4 pp 395–426, 1995.
  4. F. Bai˜ao, M. Mattoso, and G. Zaverucha, “A distribution design methodology for object DBMS,” Distributed and Parallel Databases, Springer, Vol. 16, No. 1, pp. 45–90, 2004.
  5. S. Ceri, M. Negri, and G. Pelagatti, “Horizontal data partitioning in database design,” in Proc. ACM SIGMOD, 1982, pp. 128–136.
  6. S. B. Navathe, S. Ceri, G. Wiederhold, and J. Dour, “Vertical partitioning algorithms for database design,” ACM Transactions on Database Systems (TODS), Vol. 9, No. 4, pp. 680–710, 1984.
  7. S. B. Navathe, and M. Ra, “Vertical partitioning for database design: A graphical Algorithm,” ACM SIGMOD Record, Vol. 14, No. 4, pp. 440-450, 1989.
  8. D. G. Shin, and K. B. Irani, “Fragmenting relations horizontally using a knowledge based approach,” IEEE Transactions on Software Engineering (TSE), Vol. 17, No. 9, pp. 872–883, 1991.
  9. M. Ra, “Horizontal partitioning for distributed database design,” In Advances in Database Research, World Scientific Publishing, pp. 101–120, 1993.
  10. S. Chakravarthy, J. Muthuraj, R. Varadarajan, and S. B. Navathe, “An objective function for vertically partitioning relations in distributed databases and its analysis,” Distributed and Parallel Databases, Springer, Vol. 2, No. 2, pp. 183–207, 1994.
  11. C. H. Cheng, W. K. Lee, and K. F. Wong, “A genetic algorithm-based clustering approach for database partitioning,” IEEE Transactions on Systems, Man, and Cybernetics, Vol. 32, No. 3, pp. 215–230, 2002.
  12. H. Ma, K. D. Schewe, and M. Kirchberg, “A heuristic approach to vertical fragmentation incorporating query information,” in Proc. 7th International Baltic Conference on Databases and Information Systems (DB&IS), 2006, pp. 69–76.
  13. M. AlFares et al, “Vertical Partitioning for Database Design: A Grouping Algorithm”, in Proc. International Conference on Software Engineering and Data Engineering (SEDE), 2007, pp. 218-223.
  14. F. F. Marwa, I. E. Ali, A. A. Hesham, “A heuristic approach for horizontal fragmentation and alllocation in DOODB,” in Proc. INFOS2008, 2008, pp. 9-16.
  15. E. S. Abuelyaman, “An optimized scheme for vertical partitioning of a distributed database,” Int. Journal of Computer Science & Network Security, Vol. 8, No. 1, 2008.
  16. H. Mahboubi and J. Darmont, “Enhancing XML Data Warehouse Query Performance by Fragmentation,” in Proc. ACM SAC09, 2009, pp.1555-1562.
  17. J. Whitten, L. Bentley, and K. Dittman, Systems Analysis and Design Methods, 6th Ed, McGraw-Hill, 2004.
  18. P. Surmsuk, “The integrated strategic information system planning Methodology,” IEEE Computer Society Press, pp. 467-475, 2007.
Index Terms

Computer Science
Information Sciences

Keywords

Initial Fragmentation Allocation Attribute locality precedence