Distributed database system to the database management system

skabinesh51 11 views 11 slides Oct 14, 2024
Slide 1
Slide 1 of 11
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11

About This Presentation

dbms


Slide Content

TAKSHASHILA UNIVERSITY SCHOOL OF COMPUTER SCIENCE DISTRIBUTED DATABASE SYSTEM SUBMITTED BY: SUBMITTED TO: R.ABIGAIL KALYANI MRS.R.SARANYA(MCA,M.PHIL,B.ED…,) S.ABINESH ASSISTANT PROFESSOR MCA(DS)-YEAR 1 TAKSHASHILA UNIVERSITY TAKSHASHILA UNIVERSITY

AGENDA

INTRODUCTION A DISTRIBUTED DATABASE IS A DATABASE THAT CONSIST OF DATA STORED STORED AT MULTIPLE PHYSICAL LOCATIONS. EVERY SINGLE DATABASE STORED IN ONE NETWORK. USER CAN ACCESS FROM ANYWHERE.

IMPORTANCE:

TYPES: HOMOGENEOUS : SAME STRUCTURE AND DBMS ACROSS ALL NODES. EASIER MANAGEMENT AND UNIFORMITY. HETEROGENEOUS : DIFFERENT DBMS, STRUCTURES OR MODELS.ALLOWS INTEGRATION OF DIVERSE SYSTEMS BUT REQUIRES MORE COMPLEX MANAGEMENT.

ARCHITECTURE MODELS: CLIENT SERVER ARCHITECTURE: CLIENT SEND REQUEST TO A CENTRALIZED SERVER , WHICH PROCESSES AND RESPONDS. PEER-TO-PEER: EACH PARTICIPANT NODE ACT AS BOTH CLIENT AND SERVER , SHARING RESOURCES EQUALLY.

KEY COMPONENTS :

Data distribution techniques: HORIZONTAL PARTITIONING: ROWS OF A DATASET ARE DISTRIBUTED ACROSS NODES. VERTICAL PARTITIONING:DIFFERENT COLUMNS ARE STORED IN DIFFERENT NODES. HYBRID PARTITIONING: A COMBINATION OF THE TWO METHODS ABOVE FOR OPTIMIZED PERFORMANCE.

CHALLENGES: NETWORK LATENCY: KEEPING DATA SYNCHRONIZED CAN BE COMPLEX. NETWORK CONSISTENCY: KEEPING DATA SYNCHRONIZED CAN BE COMPLEX. INCREASED COMPLEXITY: MORE COMPONENTS CAN LEAD TO MANAGEMENT AND MAINTAINANCE CHALLENGES.

CONCLUSION: DISTRIBUTED DATABASE ARCHITECTURE ENABLES EFFICIENT DATA MANAGEMENT ACROSS MULTIPLE LOCATIONS , OFFERING BENEFITS SUCH AS SCALABILITY , BUT IT ALSO INVOLVES CHALLENGES THAT REQUIRE CAREFUL PLANNING AND EXECUTION.