检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《电脑开发与应用》2007年第8期66-67,共2页Computer Development & Applications
摘 要:在实际应用中经常会有些类似财务科目式的把结点的上下层关系置入编码中的数据,以多级编码的方式存储在库表中,但有时为了获取某结点在树结构中从根结点到本身结点的名称路径却不得不要通过编程来实现。通过对Oracle的SQL语句的分析,提出用一句Oracle的SQL语句完成从根结点到本身结点名称路径的生成方法,此法在多个系统中得到实际应用,简便实用大大提高了程序的可靠性,也为其他多级编目式的树型关系数据获取绝对路径提供一种新颖的方法。Data of directory construction is often found in its application. As a form of multilevel catalog, it is stored in tables. Programming is needed to give a absolute path of the node in tree-shaped construction. This paper via the analysis of the Oracle's SQL statement, based on its application,to educe how to use one SQL statement to obtain the absolute path of the node in treeshaped construction. The method is applied in multiple application. It's simple and effective and could greatly improve the reliability of programs, also offering an entirely new method to obtain the absolute path of the node in multilevel catalog construction.
分 类 号:TP311.11[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.16.123.198