ITPub博客

首页 > 数据库 > Oracle > Oracle Connect by 单行变多行

Oracle Connect by 单行变多行

原创 Oracle 作者:abstractcyj 时间:2016-10-20 23:35:11 0 删除 编辑
create table my_t1(
  rowno number,
  wareid number,
  maxqty number,
  wareqty number
)


insert into my_t1 values(1, 100, 400, 500);
insert into my_t1 values(2, 110, 240, 600);

SELECT wareqty,
       maxqty,
       wareid,
       rowno,
       CASE
         WHEN leijia > wareqty THEN
          wareqty -
          nvl(lag(leijia) over(PARTITION BY wareid, rowno ORDER BY lv), 0)
         ELSE
          maxqty
       END allocqty
  FROM (SELECT x.*,
               LEVEL lv,
               SUM(maxqty) over(PARTITION BY wareid, rowno ORDER BY LEVEL) leijia
          FROM (SELECT ceil(wareqty / maxqty) num_rows,
                       wareqty,
                       maxqty,
                       wareid,
                       rowno,
                       SUM(ceil(wareqty / maxqty)) over(ORDER BY rownum) - rownum + 1 psum
                  FROM my_t1) x
        CONNECT BY rownum <= psum
         ORDER BY wareid, lv) t


SQL 2:

SELECT wareqty,
       maxqty,
       wareid,
       rowno,
       CASE
         WHEN leijia > wareqty THEN
          wareqty -
          nvl(lag(leijia) over(PARTITION BY wareid, rowno ORDER BY lv), 0)
         ELSE
          maxqty
       END allocqty
  FROM (SELECT x.*,
               LEVEL lv,
               SUM(maxqty) over(PARTITION BY wareid, rowno ORDER BY LEVEL) leijia
          FROM (SELECT ceil(wareqty / maxqty) num_rows,
                       wareqty,
                       maxqty,
                       wareid,
                       rowno,
                       SUM(ceil(wareqty / maxqty)) over(ORDER BY rownum) - rownum + 1 psum
                  FROM my_t1) x
        CONNECT BY rownum <= psum
         ORDER BY wareid, lv) t



来自 “ ITPUB博客 ” ,链接:https://blog.itpub.net/8520577/viewspace-2126845/ ,如需转载,请注明出处,否则将追究法律责任。

请登录后发表评论 登录
全部评论
曾从事java方向开发多年。近年已经转入数据库方向。主要擅长SQL优化,Oracle数据库问题诊断,Oracle备份与恢复等。服务于医药物流,医院等行业

注册时间:2010-01-26

  • 博文量
    602
  • 访问量
    1091588