TARU PUBLICATIONS
Journal of Dynamical Systems and Geometric Theories cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0057·ISSN (Print): 1726-037X
Powered by:Powered by

The Journal of Dynamical Systems and Geometric Theories (JDSGT) is a world leading journal publishing high quality, rigorously peer-reviewed original research on dynamical systems and geometry, including the interactions between these two subjects and interdisciplinary research with other branches of knowledge since 2003. Topics published by the Journal include but are not limited to: Random dynamical systems Geometry and physics Dynamical systems with hyperbolic behaviour Real and complex geometry Ergodic theory Distance geometry Topological dynamics Global differential geometry Infinite-dimensional Hamiltonian systems Symplectic geometry, contact geometry The journal considers original research articles, survey articles, and book reviews for publication. Responses to articles and correspondence will also be considered at the Chief Editor’s discretion.

Issues up to 2022 co-published with and available at:Taylor & Francis
info@tarupublications.com
Open Access Original Articles

Dynamical Processing Technique for Data Fragmentation in Distributed Database Systems: Design and Tool Support

, ,

* Corresponding author · click or hover a name for details

pp. 103–116Vol. 4Issue 2November 2006DOI: 10.1080/1726037X.2006.10698507XML
Received:
23 May 2005
Published Online:
01 Nov 2006
Article type:
Original Articles
Language:
EN
Article no.:
1726037X.2006.10698507
Pages:
103–116

Abstract

Data fragmentation is one of the primary techniques that has been used in partitioning and developing distributed database systems (DDBs). Database partitioning technique improves the performance of the system throughput and reduces the amount of irrelevant data to be accessed and transferred among different sites in DDBs. We propose a technique that splits the database relations into pair-wise disjoint fragments, which would be allocated to the DDBs sites during the process of allocation. This technique reduces the data transferred between the sites during the applications execution, minimizes the communication cost needed for processing applications, handles the database queries and meets their future needs, guarantees the ability of processing a given portion of a given transaction in all sites, and improves the applications speed and efficiency by minimizing the number of fragments to be accessed. We have also developed a fragmentation tool that is interactive, full functional and easy to use, based on our fragmentation life cycle algorithms to create the database segments and generate the minimum number of disjoint fragments. A case study and some results in tabular and graphical means will be presented to demonstrate the efficiency of the method.

Keywords

References

Chun-Hung, Cheng, Lee, Wing-Kin and Wong, Kam-Fai. 2002 . A Genetic Algorithm-Based Clustering Approach for Database Partitioning . IEEE Transactions On Systems, Man, And Cybernetics-Part C: Applications and Reviews, 32 ( 3 ) August 2002 Daudpota, N.H.1998 . Five steps to construct a model of data allocation for distributed database systems . Journal of Intelligent Information Systems: Integrating Artificial Intelligence and Database Technologies, 11 ( 2 ) Sept.-Oct : 153 – 168 . 1998 Wai, Gen Yee, Donahoo, Michael J. and Navathe, Shamkant B.2000 . A Framework for Server Data Fragment Grouping to Improve Server Scalability in Intermittently Synchronized Databases . CIKM 2000, November Ismail, Hababeh, Nicholas, Bowring and Muthu, Ramachandran. 2004 . A Strategy for Clustering and Fragment Allocation Design in DOODBs . The 2nd International Conference on Computer Science and its Applications ICCSA 2004 . . pp. 345 – 352 . San Diego - California: National University & US Education . Ismail, Hababeh, Nicholas, Bowring and Muthu, Ramachandran. 2005 . An Integrated Mathematical Model for the Computation of Data Fragmentation and Allocation in the Distributed Database systems . International Journal of Pure And Applied Mathematical Sciences, 2 ( 1 ) GBS Publishers & Distributors Huang, Yin-Fu and Chen, Jyh-Her. 2001 . Fragment Allocation in Distributed Database Design . Journal of Information Science and Engineering., 17 : 491 – 506 . (2001) Lee, H., Park, Y.-K., Jang, G. and Huh, S.-Y.2000 . Designing a distributed database on a local area network: A methodology and decision support system . Information and Software Technology, 42 : 171 – 184 . Minyoung, Ra and Park, Yang-sun. 1992 . Data fragmentation and allocation for PC-based distributed database design, Korea: Science & Engineering Foundation . Navathe, Karlapalem and Minyoung. 1995 . A mixed fragmentation methodology for initial distributed database design . Journal of Computer and Software Engineering, 3 ( 4 ) : 395 – 425 . 1995 Stonebraker, Michael, Aoki, Paul, Devine, Robert, Litwin, Withold and Olson, Michael. 1994 . Mariposa: A new architecture for distributed data . IEEE Database Engineering, : 54 – 65 . Ozsu, Tamer M. and Valduriez, Patrick. 1999 . Principles of Distributed Database Systems, Prentice Hall . 1999 Tamhankar, AM and Ram, S. 1998 . Database Fragmentation and Allocation: An Integrated Methodology and Case Study . IEEE Transactions on Systems, Man. and Cybernetics-Part A. Systems and Humans, 28 ( 3 ) May : 288 – 305 . 1998
Views: 15Downloads: 9Citations: 3