zoukankan      html  css  js  c++  java
  • BOM递归查询小实例

    查询某个原物料下的子组件:

    select level,
           t.*
      from (select items1.segment1 segment1_m,
                   items1.inventory_item_id m_id,
                   items1.description description_m,
                   materials.bill_sequence_id,
                   components.item_num,
                   components.operation_seq_num,
                   components.component_item_id sub_id,
                   items2.segment1 segment1_sub,
                   items2.description description_sub,
                   components.component_quantity,
                   components.EFFECTIVITY_DATE,
                   components.DISABLE_DATE
              from bom_bill_of_materials    materials,
                   mtl_system_items_b       items1,
                   bom_inventory_components components,
                   mtl_system_items_b       items2
             where materials.assembly_item_id = items1.inventory_item_id
               and materials.bill_sequence_id = components.bill_sequence_id
               and components.component_item_id = items2.inventory_item_id
               and items2.organization_id = 103
               and materials.organization_id = 103
               and items1.organization_id = 103
               and components.EFFECTIVITY_DATE <= sysdate
               and nvl(components.DISABLE_DATE,sysdate+1) > sysdate
               ) t
    connect by prior t.segment1_sub = t.segment1_m
     start with t.segment1_m = 'S-7BR1AUX-B1';

    --connect by prior t.sub_id = t.m_id
    -- start with t.m_id = '19044'

             

                成长

           /      |     \

        学习   总结   分享

    QQ交流群:122230156

  • 相关阅读:
    java—连连看-实现封装
    java—连连看GUI
    连连看--产生随机数
    勇者斗恶龙
    在ctex环境下利用Metapost作图
    [leetcode] Binary Tree Postorder Traversal
    [leetcode] Binary Tree Maximum Path Sum
    [leetcode] Binary Tree Level Order Traversal II
    [leetcode] Binary Tree Level Order Traversal
    [leetcode] Binary Tree Inorder Traversal
  • 原文地址:https://www.cnblogs.com/benio/p/1885063.html
Copyright © 2011-2022 走看看