1 / 11

SDD1 algorithm Implementation

By Vasanth Raja Chittampally IT05F M.Tech(1st Year) www.vasanthexperiments.wordpress.com. SDD1 algorithm Implementation. Overview of SDD1 Algorithm. System for Distributed Databases It is a distributed query optimization algorithm

marlee
Download Presentation

SDD1 algorithm Implementation

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. By Vasanth Raja Chittampally IT05F M.Tech(1st Year) www.vasanthexperiments.wordpress.com SDD1 algorithm Implementation

  2. Overview of SDD1 Algorithm • System for Distributed Databases • It is a distributed query optimization algorithm • It is based on “Hill Climbing” algorithm which does not use semi join nor does it assume data replication and fragmentation • Its a greedy approach it finds the local minimum and iteratively tries to improve it. It may not reach global solution all the time

  3. SDD1 Algorithm(2) • The main step of this algorithm consists of determining and ordering beneficial semijoins, that is semijoins whose cost is less than their benefit • The cost of a semijoin is that of transferring the semijoin attributes A • Cost(R SJA S) = TMSG +TTR* size(ProjectA(S)) • Benefit(R SJA S) = (1-SFSJ(S.A))*size(R)*TTR

  4. SDD Algorithm(3) • Select the most beneficial semijoin and ignore the rest i.e., MAX(Benefit-Cost) • Perform table statistics • Exclude the selected semijoin and do with the exhaustive check on all the other semijoins where Benefit > Cost

  5. SDD1 • SDD1 takes Query graph Location of relations Relation statistics as inputs • Produces: Global strategy for executing the query

  6. Implementation Details • Programming language : Java • Used Swings Components in Java • Input : Relations and its profile • Output : Gives the best strategy and the assembly site

  7. Input Window

  8. Output Window

  9. References • Query Processing in a System or Distributed Databases (SDD-1) • PHILIP A. BERNSTEIN and NATHAN GOODMAN • EUGENE WONG • CHRISTOPHER L. REEVE • JAMES B. ROTHNIE, Jr. • ACM Transactions on Database Systems, Vol. 6, No. 4, December 1961,

  10. Thank You

  11. Demo

More Related