| 半结构化查询重写的MiniCon算法 |
| |
| 引用本文： | 陶春,汪卫,施伯乐.半结构化查询重写的MiniCon算法[J].软件学报,2004,15(11):1641-1647. |
| |
| 作者姓名： | 陶春 汪卫 施伯乐 |
| |
| 作者单位： | 复旦大学,计算机与信息技术系,上海,200433 |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China under Grant No.69933010 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant No.2002AA4Z3430 (国家高技术研究发展计划(863)) |
| |
| 摘 要： | 研究了基于半结构化数据查询语言TSL(tree specification language)的查询重写问题.提出了一种半结构化查询重写算法,解决了在给定一个半结构化查询和一组半结构化视图的情况下,找到最大被包含重写的问题.算法借用了可伸缩的关系查询重写的MiniCon算法的思想,解决了半结构化数据模型之下查询重写的一些新问题(如标识符依赖、集合值变量映射等).证明了算法的正确性.
|
| 关 键 词： | 查询重写 OEM(object exchange model) 查询包含 包含映射 MiniCon 半结构化数据 |
| 文章编号： | 1000-9825/15(11)1641 |
| 收稿时间： | 2003/5/27 0:00:00 |
| 修稿时间： | 1/6/2004 12:00:00 AM |
MiniCon Algorithm for Semi-Structured Query Rewriting |
| |
| TAO Chun,WANG Wei and SHI Bai-Le.MiniCon Algorithm for Semi-Structured Query Rewriting[J].Journal of Software,2004,15(11):1641-1647. |
| |
| Authors: | TAO Chun WANG Wei and SHI Bai-Le |
| |
| Abstract: | This paper addresses the semi-structured query rewriting problem for TSL (tree specification language), a language for querying semi-structured data. An algorithm that can find the maximally-contained rewriting query is presented, when a semi-structured query and a set of semi-structured views are given. The idea is borrowed from MiniCon, a scalable relational query rewriting algorithm, and some new problems for semi-structured query rewriting, e.g., object-id dependency and set value variable mapping, are solved. It is shown that the algorithm is correct. |
| |
| Keywords: | query rewriting OEM (object exchange model) query containment containment mapping MiniCon semi-structured data |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
