zoukankan      html  css  js  c++  java
  • SQLZOO: Self join

    stops(id, name)
    route(num, company, pos, stop)
    
     
    stops
    id
    name
    route
    num
    company
    pos
    stop

     
    1.How many stops are in the database.
    SELECT COUNT(DISTINCT(stop))
    FROM route
    2.Find the id value for the stop 'Craiglockhart'
    SELECT id 
    FROM stops 
    WHERE name= 'Craiglockhart'
    3.Give the id and the name for the stops on the '4' 'LRT' service.
    SELECT id,name
    FROM stops JOIN route ON id=stop
    WHERE num='4' AND company='LRT'
    4.The query shown gives the number of routes that visit either London Road (149) or Craiglockhart (53). Run the query and notice the two services that link these stops have a count of 2. Add a HAVING clause to restrict the output to these two routes.
    SELECT company, num, COUNT(*)
    FROM route WHERE stop=149 OR stop=53
    GROUP BY company, num
    HAVING COUNT(*)=2
    5.

    Execute the self join shown and observe that b.stop gives all the places you can get to from Craiglockhart, without changing routes. Change the query so that it shows the services from Craiglockhart to London Road.

    SELECT a.company, a.num, a.stop, b.stop
    FROM route a JOIN route b ON
      (a.company=b.company AND a.num=b.num)
    WHERE a.stop=53 AND b.stop=149
    6.The query shown is similar to the previous one, however by joining two copies of the stops table we can refer to stops by name rather than by number. Change the query so that the services between 'Craiglockhart' and 'London Road' are shown. If you are tired of these places try 'Fairmilehead' against 'Tollcross'
    SELECT a.company, a.num, stopa.name, stopb.name
    FROM route a JOIN route b ON
      (a.company=b.company AND a.num=b.num)
      JOIN stops stopa ON (a.stop=stopa.id)
      JOIN stops stopb ON (b.stop=stopb.id)
    WHERE stopa.name='Craiglockhart' AND stopb.name= 'London Road'
    7.Give a list of all the services which connect stops 115 and 137 ('Haymarket' and 'Leith')
    SELECT DISTINCT a.company,a.num 
    FROM route a JOIN route b ON (a.company=b.company AND a.num=b.num)
    WHERE a.stop=115 AND b.stop=137
    8.Give a list of the services which connect the stops 'Craiglockhart' and 'Tollcross'
    SELECT a.company, a.num
    FROM route a JOIN route b ON
      (a.company=b.company AND a.num=b.num)
      JOIN stops stopa ON (a.stop=stopa.id)
      JOIN stops stopb ON (b.stop=stopb.id)
    WHERE stopa.name='Craiglockhart' AND stopb.name= 'Tollcross'
    9.Give a distinct list of the stops which may be reached from 'Craiglockhart' by taking one bus, including 'Craiglockhart' itself, offered by the LRT company. Include the company and bus no. of the relevant services.
    SELECT DISTINCT name, company, num 
    FROM route JOIN stops ON stop=id 
    WHERE num IN (
       SELECT num 
       FROM route JOIN stops ON stop=id 
       WHERE name='Craiglockhart') 
    AND company='LRT'
    10.

    Find the routes involving two buses that can go from Craiglockhart to Lochend.
    Show the bus no. and company for the first bus, the name of the stop for the transfer,
    and the bus no. and company for the second bus.

    Hint
    Self-join twice to find buses that visit Craiglockhart and Lochend, then join those on matching stops.
    select distinct x.num,x.company,name,y.num,y.company
    from(select a.num,a.company,b.stop
    from route a
    join route b
    on a.num = b.num and a.company = b.company
    and a.stop != b.stop
    where a.stop = (select id from stops where name ='Craiglockhart')) as x
    join (select c.num,c.company,c.stop
    from route c
    join route d 
    on c.num = d.num and c.company = d.company
    and c.stop != d.stop
    where d.stop =(select id from stops where name = 'Lochend'))as y
    on x.stop = y.stop
    join stops on x.stop = stops.id
    order by x.num,stops.name,y.num
  • 相关阅读:
    BZOJ1001 狼抓兔子 终于过了!
    BZOJ 1901: Zju2112 Dynamic Rankings( 树状数组套主席树 )
    BZOJ 2302: [HAOI2011]Problem c( dp )
    BZOJ 1407: [Noi2002]Savage( 数论 )
    BZOJ 2661: [BeiJing wc2012]连连看( 费用流 )
    BZOJ 1021: [SHOI2008]Debt 循环的债务( dp )
    BZOJ 3170: [Tjoi 2013]松鼠聚会( sort )
    BZOJ 2301: [HAOI2011]Problem b( 数论 )
    BZOJ 2434: [Noi2011]阿狸的打字机( AC自动机 + DFS序 + 树状数组 )
    BZOJ 3231: [Sdoi2008]递归数列( 矩阵快速幂 )
  • 原文地址:https://www.cnblogs.com/gegemu/p/13650412.html
Copyright © 2011-2022 走看看