半结构化查询重写的MiniCon算法.pdf

1000-9825/2004/15(11)1641 ©2004 Journal of Software 软 件 学 报 Vol.15, No.11 半结构化查询重写的MiniCon 算法 + 陶 春, 汪 卫, 施伯乐 (复旦大学 计算机与信息技术系,上海 200433) MiniCon Algorithm for Semi-Structured Query Rewriting + TAO Chun , WANG Wei, SHI Bai-Le (Department of Computing and Information Technology, Fudan University, Shanghai 200433, China) + Corresponding author: Phn: +86-21 Fax: +86-21 E-mail: ctao@, Received 2003-05-27; Accepted 2004-01-06 Tao C, Wang W, Shi BL. MiniCon algorithm for semi -structured query rewriting. Journal of Software, 2004,15(11):1641~1647. /1000-9825/15/ 1641.htm 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. Key words : query rewriting; OEM (object exchange model); query containment; containment mapping; MiniCon; semi-structured data 摘 要: 研究了基于半结构化数据查询语言 TSL(tree specification language) 的查询重写问题.提出了一种半结 构化查询重写算法,解决了在给定一个半结构化查询和一组半结构化视图的情况下,找到最大被包含重写的问 题.算法借用了可伸缩的关系查询重写的 MiniCon 算法的思想,解决了半结构化数据模型之下查询重写的一些 新问题(如标识符依赖 集合值变量映射等).证明了算法的正确性. 关键词: 查询重写;OEM(object exchange model);查询包含;包含映射;MiniCon;半结构化数据 中图法分类号: TP311 文献标识码: A 由于涉及数据管理的多个方面,如数据集成 查询优化 物理数据独立性等,使用视图回答查询的问题引 起了广泛的关注.简而言之,这一问题就是在给定数据库上的一个查询Q 和一组视图 V={ V , V , …, V }的情况下,