计算机工程 ›› 2011, Vol. 37 ›› Issue (17): 49-51.doi: 10.3969/j.issn.1000-3428.2011.17.015

• 软件技术与数据库 • 上一篇    下一篇

基于递归和表函数的一到多数据转换研究

王剑波   

  1. (湖南人文科技学院计算机科学技术系,湖南 娄底 417000)
  • 收稿日期:2011-03-18 出版日期:2011-09-05 发布日期:2011-09-05
  • 作者简介:王剑波(1978-),男,讲师、硕士、CCF会员,主研方向:数据库技术,电子商务
  • 基金项目:
    湖南省教育厅优秀青年基金资助项目(10B056)

Research on One-to-many Data Transformation Based on Recursive and Table Function

WANG Jian-bo   

  1. (Department of Computer Science and Technology, Hunan University of Humanities, Science and Technology, Loudi 417000, China)
  • Received:2011-03-18 Online:2011-09-05 Published:2011-09-05

摘要: 针对关系表达式难以进行无限制一到多数据转换的问题,通过关系代数的扩展表达一到多数据转换,采用递归查询和表函数实现无限制一到多数据转换,在每个输入元组上产生一个或者多个输出元组。递归查询通过创建初始结果,递归获取结果集,并返回最终结果集;表函数声明变量集合,使用过程体和游标循环访问表,迭代输出元组。实验分析不同参数影响因素下有限制和无限制转换的不同方法,结果表明扩展方法能够改善系统性能。

关键词: 关系数据库, 数据转换, 结构化查询语言, 递归查询, 表函数

Abstract: Since relational expressions are difficult to execute one-to-many data transformation, the paper expresses one-to-many transformation by extending relational algebra, the recursive query and the table function should be employed to realize unbounded one-to-many transformation for producing one or several output tuples over every input tuples. Recursive queries create original results to obtain result sets by recursion and return final result sets. Table functions declare variable sets and employ a procedure body and cursor to access tables, iterative output tuples. Experiment analyzes different bounded and unbounded data transformations under different reference influencing factor. The results show the extension method improves performance observably.

Key words: relational database, data transformation, Structure Query Language(SQL), recursive query, table function

中图分类号: