Advertisement
Guest User

Untitled

a guest
Feb 20th, 2019
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.65 KB | None | 0 0
  1. D.id = 1, open=true, D.CID = 2
  2. D.id = 2, open=true, D.CID = 3
  3. D.id = 3, open=true, D.CID = 3
  4. D.id = 4, open=true, D.CID = 4
  5.  
  6. C.id = 2, A.id = 3, B.id = 5
  7. C.id = 3, A.id = 3, B.id = 5
  8. C.id = 4, A.id = 4, B.id = 6
  9.  
  10. 1. count = 3 A.id = 3 B.id = 5
  11. 2. count = 1 A.id = 4 B.id = 6
  12.  
  13. For each entry i in tuple Table AB
  14. for each entry j in Table C
  15. for each entry k in Table D
  16. if j.AID AND j.BID equal to i.AID and i.BID
  17. And if k.CID = j.id
  18. Then returnHash[i] = returnHash[i] + 1
  19.  
  20. SELECT
  21. COUNT(*),
  22. c.aid,
  23. c.bid
  24. FROM
  25. d INNER JOIN c
  26. ON
  27. d.cid = c.id
  28. WHERE
  29. d.open
  30. GROUP BY
  31. c.aid,
  32. c.bid;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement