Considerable Progress has been made in the last few years in improving the performance of the distributed database systems. The development of Fragment allocation models in Distributed database is becoming difficult due to the complexity of huge number of sites and their communication considerations. Under such conditions, simulation of clustering and data allocation is adequate tools for understanding and evaluating the performance of data allocation in Distributed databases. Clustering sites and fragment allocation are key challenges in Distributed database performance, and are considered to be efficient methods that have a major role in reducing transferred and accessed data during the execution of applications. In this paper a review on Fragment allocation by using Clustering technique is given in Distributed Database System.

 

Published In : IJCSN Journal Volume 2, Issue 5

Date of Publication : 01 October 2013

Pages : 24 - 32

Figures : 2

Tables : 02

Publication Link : ijcsn.org/IJCSN-2013/2-5/IJCSN-2013-2-5-36.pdf

 

 

 

Mrs.Ranjita Rout : is working as Assistant Professor in Computer Science and Engineering Department in PIET Rourkela, Odisha, India. Her area of interest is Distributed Database System and Image Processing.

Mr. Satya Bhusan Pratihari : is working as Assistant Professor in Computer Science and Engineering Department in INDUS College of Engineering, Bhubaneswar, Odisha, India. His area of interest is Adhoc Network, Wireless Sensor Network and Distributed Database System.

Mr.Sanjay Kumar Padhi : is working as Associate Professor in Computer Science and Engineering department in KIST, Bhubaneswar, Odisha, India. His area of interest is Wireless Sensor Network, Adhoc Network, Data Mining, Distributed Database System, Neural Network, Software Engineering, cloud computing etc.

 

 

 

 

 

 

 

Distribute Database System

 

 

 

 

 

 

 

 

----

 

 

 

 

 

 

 

 

 

[1] Principles of Distributed Database Systems, Ozsu, M. Tamer, Valduriez, Patrick,3rd ed. 2011, XIX, 845p.

[2] Ceri,S, and Pelgatti,G.Distributed Database Principles and System. Mcgraw Hill, New York.

[3] Reddy, S.V.P. ; Kumar, T.V.S. ; Kanth, K.R. Jaganatha, S. Dept. of Comput. Applic., MSRIT, Bangalore,”Simulation and analysis of performance prediction in Distributed Database design using OO approach “Publication Year: 2013, Page(s): 1324 – 1329.

[4] Chen, Xu ; Jianwei Huang,”Game Theoretic Analysis of Distributed Spectrum Sharing with Database. Publication Year: 2012, Page(s): 255 – 264.

[5] Dingyu Yang ; Jian Cao,” A Scalable Data Warehouse Model Based on Complex Semantic Event Processing in Distributed Systems “International Conference on Data Engineering Workshops (ICDEW) 2012 IEEE 28th ,Publication Year: 2012 , Page(s): 94 – 97.

[6] Abdalla, H.I. ; Amer, A.A. ,” Dynamic horizontal fragmentation, replication and allocation model in DDBSs , International Conference on Information Technology and e-Services (ICITeS), 2012 Publication Year: 2012 , Page(s): 1 – 7.

[7] Amer, A.A. ; Abdalla, H.I. ,” An integrated design scheme for performance optimization in distributed environments “,International Conference on Education and e-Learning Innovations (ICEELI), 2012 Publication Year: 2012 , Page(s): 1 – 8.

[8] Hababeh, I.O. ,”A software development tool for improving Quality of Service in Distributed Database Systems “,International Conference on Innovations in Information Technology, 2009. IIT '09. Publication Year: 2009 , Page(s): 210 – 214.

[9] Khan, S.I., Hoque, A.S.M.L.,” Scalability and performance analysis of CRUD matrix based fragmentation technique for distributed database”,15th International Conference on Computer and Information Technology (ICCIT),2012,Publication Year: 2012 , Page(s): 567 – 562.

[10] Faheem, M.T. ; Sarhan, A. ; Ibrahem, R.L.”Fragmentation and allocation of object-oriented databases for simple attributes and complex methods: a cost-based technique”,Publication Year:2005,Page(s):731-749.

[11] Marir, F. ; Najjar, Y. ; AlFaress, M.Y. ; Abdalla, H.I.,”. An enhanced grouping algorithm for vertical partitioning problem in DDBs “,international symposium on Computer and information sciences, 2007. iscis 2007. 22nd Publication Year: 2007 , Page(s): 1 – 6.

[12] Zanin, G. ; Mei, A. ; Mancini, L.V. ,” Towards a secure dynamic allocation of files in large scale distributed file systems “,International Workshop on Peer-to-Peer Systems, 2004. Publication Year: 2004 , Page(s): 102 – 107.

[13] Son J,Kim M,An adaptable vertical partitioning method in Distributed Systems,J Syst. Soft.Elsevier,2003.

[14] M.Khlaif, M.Talb, Digital Data Security and Copyright Protection Using Cellular Automata, arXiv:1307.0082.

[15] T.Ilusand,M.Uysal,Heuristic approach to dynamic data allocation in distributed database systems,Pakistan Journal of Informaion and Technology,vol.2,pp.1682- 6027,2003.

[16] R.Basseda,S.Tasharofi,and M.Rahgozar, Near neighborhood allocation (nna):A novel dynamic data allocation algorithm in ddb,in proceedings of 11th Computer Society of Iran Intl Computer Conference.Tehran,Iran:Computer Society of Iran,March,pp.64-72,2006.

[17] R.Basseda,S.Tasharofi,and M.Rahgozar,A novel Fuzzy Approach to Improve Near Neighborhood Allocation Algorithm in DDB.Database Research Group IEEE,PP.3806-4244,2009. Mrs. Priyanka Dash is working as Lecturer in Computer Science and Engineering Department in GITAM, BBSR, Odisha, India.Her area of interest is Distributed Database System.