1 / 126

Distributed Databases

Distributed Databases. Semantic Data Control. Distributed Query Processing. Distributed Database Design. System Architecture. Distributed Transaction Management. ANSI/SPARC Architecture DBMS Implementation Alternatives Datalogical Architecture Clients/Server Architecture

terris
Download Presentation

Distributed Databases

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. Distributed Databases Semantic Data Control Distributed Query Processing Distributed Database Design System Architecture Distributed Transaction Management Yangjun Chen

  2. ANSI/SPARC Architecture DBMS Implementation Alternatives Datalogical Architecture Clients/Server Architecture Components of a Multi-DBMS System Architecture Yangjun Chen

  3. Yangjun Chen

  4. Yangjun Chen

  5. Yangjun Chen

  6. Yangjun Chen

  7. Yangjun Chen

  8. Yangjun Chen

  9. Yangjun Chen

  10. Yangjun Chen

  11. Yangjun Chen

  12. Yangjun Chen

  13. Relation Fragmentation • Horizontal, Vertical, Hybrid • Correctness of Fragmentation • Completeness, Reconstruction, Disjointness • Algorithms • COM_MIN Al. , Bond Energy Al. • Fragment Allocation Distributed DBMS Design Yangjun Chen

  14. Yangjun Chen

  15. Yangjun Chen

  16. Yangjun Chen

  17. Yangjun Chen

  18. Yangjun Chen

  19. Yangjun Chen

  20. Algorithms for horizontal fragmentation: • COM_MIN Algorithm Given a relation and a set of predicates, it will find a complete and minimal set of predicates • Horizontal Algorithm Given a complete and minimal set of predicates, it will produce a horizontal fragmentation Yangjun Chen

  21. Yangjun Chen

  22. Yangjun Chen

  23. Yangjun Chen

  24. Yangjun Chen

  25. Yangjun Chen

  26. Yangjun Chen

  27. Yangjun Chen

  28. Yangjun Chen

  29. Yangjun Chen

  30. Yangjun Chen

  31. Yangjun Chen

  32. Yangjun Chen

  33. Yangjun Chen

  34. Yangjun Chen

  35. Global affinity measure: GAM = aff(Ai, Aj)*[aff(Ai, Aj-1) + aff(Ai, Aj+1) + aff(Ai-1, Aj) + aff(Ai+1, Aj)] Since the affinity matrix is symmetric, we have GAM = 2 * aff(Ai, Aj)*[aff(Ai, Aj-1) + aff(Ai, Aj+1 )] AM = aff(Ai, Aj)*[aff(Ai, Aj-1) + aff(Ai, Aj+1 )] Yangjun Chen

  36. Global affinity measure: AM = aff(Ai, Aj)*[aff(Ai, Aj-1) + aff(Ai, Aj+1)] = [aff(Ai, Aj)*aff(Ai, Aj-1) + aff(Ai, Aj)*aff(Ai, Aj+1)] = [ aff(Ai, Aj)*aff(Ai, Aj-1) + aff(Ai, Aj)*aff(Ai, Aj+1)] = [bond(Ai, Aj-1) + bond(Ai, Aj+1)], Where bond(Ax, Ay) = aff(Az, Ax)*aff(Az, Ay). Yangjun Chen

  37. Relation schema: R[A1, …, Ai, …, Aj, …, Ak-1, Ak, …, An] Affinity matrix: A1, …, Ai, …, Aj, …, Ak-1, Ak, …, An … … … … … Clustered affinity matrix: Ai1, …, Ail,Ai , Aj, Ai(l+3), …, Ai(k-1) Ai1, …, Ail,Ai , Ak , Aj, Ai(l+3), …, … … … … … … new old Yangjun Chen

  38. AMold = [bond(Ais, Ai(s-1)) + bond(Ais, Aj(s+1))] + bond(Ai, Ail) + bond(Ai, Aj) + bond(Aj, Ai) + bond(Aj, Ai(l+3)) + [bond(Ais, Ai(s-1)) + bond(Ais, Aj(s+1))] AMnew = [bond(Ais, Ai(s-1)) + bond(Ais, Aj(s+1))] + bond(Ai, Ail) + bond(Ai, Ak) + bond(Ak, Ai) + bond(Ak, Aj) + bond(Aj, Ak) + bond(Aj, Ai(l+3)) + [bond(Ais, Ai(s-1)) + bond(Ais, Aj(s+1))] AMnew – AMold = 2* bond(Ai, Ak) + 2* bond(Aj, Ak) – 2* bond(Ai, Aj) Yangjun Chen

  39. Yangjun Chen

  40. Yangjun Chen

  41. Yangjun Chen

  42. Yangjun Chen

  43. Yangjun Chen

  44. Yangjun Chen

  45. Yangjun Chen

  46. Yangjun Chen

  47. Yangjun Chen

  48. Yangjun Chen

  49. Yangjun Chen

  50. Yangjun Chen

More Related