###
DOI:
Journal of Software:2004.15(11):1641-1647

半结构化查询重写的MiniCon算法
陶春,汪卫,施伯乐
(复旦大学,计算机与信息技术系,上海,200433)
MiniCon Algorithm for Semi-Structured Query Rewriting
TAO Chun,WANG Wei,SHI Bai-Le
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2876   Download 2969
Received:May 27, 2003    Revised:January 06, 2004
> 中文摘要: 研究了基于半结构化数据查询语言TSL(tree specification language)的查询重写问题.提出了一种半结构化查询重写算法,解决了在给定一个半结构化查询和一组半结构化视图的情况下,找到最大被包含重写的问题.算法借用了可伸缩的关系查询重写的MiniCon算法的思想,解决了半结构化数据模型之下查询重写的一些新问题(如标识符依赖、集合值变量映射等).证明了算法的正确性.
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.
文章编号:     中图分类号:    文献标志码:
基金项目: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)) 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))
Foundation items:
Reference text:

陶春,汪卫,施伯乐.半结构化查询重写的MiniCon算法.软件学报,2004,15(11):1641-1647

TAO Chun,WANG Wei,SHI Bai-Le.MiniCon Algorithm for Semi-Structured Query Rewriting.Journal of Software,2004,15(11):1641-1647