An Extended Technique for Data Partitioning and Distribution in Distributed Database Systems (DDBSs)
DOI:
https://doi.org/10.22385/jctecs.v12i0.152Keywords:
Partitioning, Allocation, Replication, Site Clustering, DDBS.Abstract
In this work, an extended heuristic horizontal partitioning, and data allocation technique is set to be designed. As a matter of fact, the key focus behind this work is to introduce an efficient solution in purpose of enhancing DDBS rendering. Such intended enhancement however is bound to be achieved through presenting an intelligent data partitioning method, drawing outstandingly-designed site clustering algorithm, and developing mathematically-calculated data allocation cost model. However, as partitioning technique is already developed, this work aims at extending this technique by having it skillfully integrated with site clustering algorithm and mathematical model for data allocation, including data replication, for the sake of producing an effective work. Consequently, this technique is set to be promising and capable of tremendously lessening the overall cost of data transmission (TC).Downloads
References
Hassan I. Abdalla. “A synchronized design technique for efficient data
distribution.” Computers in Human Behavior. Volume 30, Pp 427–435.
(2014).
Adel A. Sewisy, Ali Abdullah Amer, Hassan I. Abdalla. “A Novel
Query-Driven Clustering-Based Technique for Vertical Fragmentation
and Allocation in Distributed Database Systems.” International Journal
on Semantic Web and Information Systems (IJSWIS), Volume 13(2).
(2017).
S. Ceri, M. Negri, and G. Pelagatti. “Horizontal data partitioning in
database design.” ACM SIGMOD international conference on
Management of data. Pp 128-136. (1982).
S.Ceri, B.Pernici and G. Wiederhold. “Optimization Problems and
Solution Methods in the Design of Data Distribution.” Journal
Information Systems. Volume 14 Issue 3. Pp 261 - 272. (1986).
Yanchun Zhang, Maria E. Orlowska. “On Fragmentation Approaches
for Distributed Database Design.” Information Sciences – Applications..
Volume 1, Issue 3, Pp 117-132. (1994).
P. Surmsuk and Thanawastien, S. “The integrated strategic information
system planning Methodology.” Enterprise Distributed Object
Computing, 11th IEEE International Conference. (2007).
Ali A. Amer and Hassan I. Abdalla. “Dynamic Horizontal
Fragmentation, Replication and Allocation Model In DDBSs.” IEEE
International Conference on Information Technology and e-Services,
Sousse, Tunisia. (2012).
S. Harikumar, R. Ramachandran. “Hybridized fragmentation of very
large databases using clustering.” IEEE Signal Processing, Informatics,
Communication and Energy Systems (SPICES). Pp 1-5. (2015).
Jon Olav Hauglid, Norvald H. Ryeng and Kjetil Norvag. “Dynamic
Fragmentation and Replica Management in Distributed Database
Systems.” Journal of Distributed and Parallel Databases. Vol. 28 No. 3,
pp. 1- 25. (2010).
Ahmed E. Abdel Raouf, Nagwa L. Badr and Mohamed Fahmy Tolba,
“Distributed Database System (DSS) Design Over a Cloud
Environment.” © Springer International Publishing AG, Multimedia
Forensics and Security. Pp.97-116, (2017).
Xuemin Lin, M. Orlowska ; Yanchun Zhang. “On data allocation with
the minimum overall communication costs in distributed database
design.” Computing and Information, fifth International Conference.
(1993).
Yin-Fu Huang, Jyh-Her Chen. “Fragment Allocation in Distributed
Database Design.” Journal of Information Science and Engineering.
(2001).
Leon Tâmbulea.; Manuela. Horvat. “Dynamic Distribution Model in
Distributed Database.” International Journal of Computers,
Communications & Control; Supplement. Vol. 3 Issue 3, Pp 512.515.
(2008).
Amita Goyal Chin. “Incremental Data Allocation and Reallocation in
Distributed Database Systems.” Data warehousing and web engineering,
IRM Press Hershey, PA, United States. Pp 137-160. (2002).
Hassan I. Abdalla, Ali A. Amer and Hassan Mathkour. “Performance
Optimality Enhancement Algorithm in DDBS (POEA).” Journal of
Computers in Human Behavior. 30, 419–426. (2014).
Nilarun Mukherjee. “Synthesis of Non-Replicated Dynamic Fragment
Allocation Algorithm in Distributed Database Systems.” ACEEE Int. J.
on Information Technology. Vol. 01, No. 01. (2011).
Dejan Chandra Gope. “Dynamic Data Allocation Methods in Distributed Database System.” American Academic & Scholarly Research Journal. Vol. 4, No. 6. (2012).
Arjan Singh. “Empirical Evaluation of Threshold and Time Constraint
Algorithm for Non-replicated Dynamic Data Allocation in Distributed
Database Systems. Proceedings of the International Congress on
Information and Communication Technology, Advances in Intelligent
Systems and Computing 439. (2016).
T. Ulus and M. Uysal. “A Threshold Based Dynamic Data Allocation
Algorithm.” A Markove Chain Model Approach. Journal of Applied
Science. vol. 7, Issue 2, Pp 165-174. (2007).
Arjan Singh and K.S. Kahlon. “Non-replicated Dynamic Data
Allocation in Distributed Database Systems.” IJCSNS International
Journal of Computer Science and Network Security. VOL.9 No.9.
(2009).
Raju Kumar, Neena Gupta. An Extended Efficient Approach to
Dynamic Fragment Allocation in Distributed Database Systems, I J C T
A. Pp. 473-482 © International Science Press. (2016).
Wiese, L. “Horizontal fragmentation and replication for multiple
relaxation attributes.” Data Science (30th British International
Conference on Databases). Pp. 157-169. Springer. (2015).
L. Wiese, T. Waage and F. Bollwein. “A Replication Scheme for
Multiple Fragmentations with Overlapping Fragments.” The Computer
Journal. (2016).
Rizik M.H. Al-Sayyed, Fawaz A. Al Zaghoul, Dima Suleiman, Mariam
Itriq, Ismail Hababeh. “A new Approach for Database Fragmentation
and Allocation to Improve the Distributed Database Management
System Performance.” Journal of Software Engineering and
ApplicationV7 . 891-905. (2014).
M. Tamer Ozsu and Patrick Valduriez. Principles of Distributed
Database Systems. 3Edition, New Jersey: Prentice-Hall. (2011).
Bellatreche, L. and Kerkad. “A. Query interaction based approach for horizontal data partitioning.” International Journal of Data Warehousing and Mining, (IJDWM). Volume 11, Pp44-61. (2015).
Downloads
Published
Issue
Section
License
The journal is currently an open access journal.
The articles receive both rigorous peer-review and expedited online publication.
The journal encourages young researchers to submit their unpublished papers.
The authors retain their article’s copyright.
The authors retain publishing rights without restrictions.
Thus, authors may use their own articles for the following non-commercial purposes without asking our permission (and subject only to acknowledging first publication in Journal of Communications Technology, Electronics and Computer Science and giving a full reference or web link, as appropriate).
Authors cannot submit a manuscript for publication to other journals simultaneously. It is a waste of valuable resources because editors and referees spent a great deal of time processing submitted manuscripts. It is also unethical to republish similar research articles (text/figures/tables) again because journals have limited page space and it most likely violates copyrights which have already been transferred to the first journal. Therefore, all journals require a signed author's copyright transfer agreement stating the originality of the research work submitted through a manuscript. As stated above that authors should submit original, new and unpublished research work to the journal. The ethical issues such as plagiarism, fraudulent and duplicate publication, violation of copyrights, authorship and conflict of interest are serious issues concerning ethical integrity when submitting a manuscript to a journal for publication.
The contents of papers are the sole responsibility of the authors, and publication shall not imply the concurrence of the Editors or Publisher.