zoukankan      html  css  js  c++  java
  • imp导入前对当前用户清库脚本


    --清空当前用户所有表
    begin
    for i in ( select 'drop table '|| a.tab_name as sqls from (select distinct t.tab_name from (select Lower(table_name) as tab_name from user_tables) t) a ) loop
    dbms_output.put_line(i.sqls);
    execute immediate i.sqls;
    end loop;
    end;
    /

    --清空当前用户视图
    begin
    for i in ( select 'drop view ' || view_name ||' ' as sqls from user_views ) loop
    dbms_output.put_line(i.sqls);
    execute immediate i.sqls;
    end loop;
    end;
    /

    --清空当前用户函数
    begin
    for i in ( select 'drop function ' || object_name ||' ' as sqls from user_objects where object_type='FUNCTION' ) loop
    dbms_output.put_line(i.sqls);
    execute immediate i.sqls;
    end loop;
    end;
    /

    --清空当前用户存储过程
    begin
    for i in ( select 'drop procedure ' || object_name|| ' ' as sqls from user_objects where object_type='PROCEDURE' ) loop
    dbms_output.put_line(i.sqls);
    execute immediate i.sqls;
    end loop;
    end;
    /

    --清空当前用户包
    begin
    for i in ( select 'drop procedure ' || object_name|| ' ' as sqls from user_objects where object_type='PROCEDURE' ) loop
    dbms_output.put_line(i.sqls);
    execute immediate i.sqls;
    end loop;
    end;
    /

    --清空用户自定义类型对象
    begin
    for i in ( select 'drop '|| o.OBJECT_TYPE||' ' ||o.OBJECT_NAME || ' force ' as sqls from user_objects o where o.OBJECT_TYPE like 'TYPE' or o.OBJECT_TYPE like 'type' ) loop
        dbms_output.put_line(i.sqls);
    execute immediate i.sqls;
    end loop;
    end;
    /

    --清空用户自定义序列对象
    begin
    for i in ( select 'drop '|| o.OBJECT_TYPE||' ' ||o.OBJECT_NAME as sqls from user_objects o where o.OBJECT_TYPE like 'SEQUENCE' or o.OBJECT_TYPE like 'sequence' ) loop
        dbms_output.put_line(i.sqls);
    execute immediate i.sqls;
    end loop;
    end;
    /

  • 相关阅读:
    轮播图
    原生js实现分页效果(带实例)
    mint-ui Toast icon 图标
    阮小二买彩票
    js事件冒泡和事件捕捉
    html,css,js加载顺序
    单调栈-哈希表-768. 最多能完成排序的块 II
    同余问题-三整除系列
    动态规划-区间dp-单调栈-1130. 叶值的最小代价生成树
    动态规划-1Ddp-983. 最低票价
  • 原文地址:https://www.cnblogs.com/skiing886/p/7616329.html
Copyright © 2011-2022 走看看