1 / 31

PARALLEL DATABASE MANAGEMENT SYSTEM

2. Yet Another Parallelism. Parallel processing systems, parallel Operating systems , parallel execution of threads etc .But there is yet another parallelism in our basic Database which is one of the imperative part of any software system. Hence the systems where transactions with the databa

ewa
Download Presentation

PARALLEL DATABASE MANAGEMENT SYSTEM

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. 1 PARALLEL DATABASE MANAGEMENT SYSTEM

    2. 2

    3. 3 Database Management

    4. 4 Why Parallel Access To Data ??

    5. 5

    6. 6

    7. 7

    8. 8

    9. 9

    10. 10

    11. 11

    12. 12

    13. 13

    14. 14

    15. 15

    16. 16

    17. 17

    18. 18

    19. 19

    20. 20

    21. 21

    22. 22

    23. 23 Comparison (Cont.) Advantages: Provides data clustering by partitioning attribute value. Good for sequential access Good for point queries on partitioning attribute: only one disk needs to be accessed. For range queries on partitioning attribute, one to a few disks may need to be accessed Remaining disks are available for other queries. Good if result tuples are from one to a few blocks.

    24. 24 Parallel Join Processing The join operation requires pairs of tuples to be tested to see if they satisfy the join condition, and if they do, the pair is added to the join output. Parallel join includes two steeps: step1: Partition the relations. step2: Join the relations. Basically there are two joins exits: Equi-join Non-equi-join

    25. 25 Partitioned Join For equi-joins it is possible to partition the two input relations across the processors, and compute the join locally at each processor. Let r and s be the input relations r and s each are partitioned into n partitions, denoted r0, r1, ..., rn-1 and s0, s1, ..., sn-1. Can use either range partitioning or hash partitioning. Partitions ri and si are sent to processor Pi.

    26. 26 Partitioned Join (Cont.)

    27. 27 Fragment-and-Replicate Join Partitioning not possible for some join conditions e.g., non-equijoin conditions, such as r.A > s.B. For joins where partitioning is not applicable, parallelization can be accomplished by fragment and replicate technique Special case – asymmetric fragment-and-replicate: One of the relations, say r, is partitioned; any partitioning technique can be used. The other relation, s, is replicated across all the processors. Processor Pi then locally computes the join of ri with all of s using any join technique.

    28. 28 Fragment-and-Replicate Joins (Cont.)

    29. 29 Advantages Of PDBMS Share ability Improved Availability Improved Reliability Improved Performance Economics

    30. 30 Disadvantages Of PDBMS Complexity Cost Security Lack of Standards Lack of Experience Database Design More Complex

    31. 31

More Related