| 布尔查询的改写算法 |
| |
| 引用本文： | 谢丽聪,俞建家,张莹. 布尔查询的改写算法[J]. 福州大学学报(自然科学版), 2004, 32(4): 457-461 |
| |
| 作者姓名： | 谢丽聪 俞建家 张莹 |
| |
| 作者单位： | 福州大学数学与计算机科学学院,福建,福州,350002 |
| |
| 基金项目： | 福建省教育厅科研资助项目(JB03054，JB02099，JB02100) |
| |
| 摘 要： | 研究数据集成中的布尔查询的改写问题.考虑布尔查询的特殊性,简化了布尔查询的改写处理,给出了在封闭世界假设下的多项式改写算法和开放世界假设下的指数型改写算法,同时说明两个算法都是可靠的.
|
| 关 键 词： | 布尔查询 改写算法 封闭世界假设 开放世界假设 |
| 文章编号： | 1000-2243(2004)04-0457-05 |
| 修稿时间： | 2004-04-12 |
Rewriting algorithms of Boolean queries |
| |
| XIE Li-cong,YU Jian-ji,ZHANG Ying. Rewriting algorithms of Boolean queries[J]. Journal of Fuzhou University(Natural Science Edition), 2004, 32(4): 457-461 |
| |
| Authors: | XIE Li-cong YU Jian-ji ZHANG Ying |
| |
| Affiliation: | (College of Mathematics and Computer Science, Fuzhou University, Fuzhou, Fujian 350002, China) |
| |
| Abstract: | The problem of rewriting for Boolean query in data integration systems is addressed. With consideration of its specialties, the process of rewriting for Boolean query is simplified. A polynomial time rewriting algorithm under the closed world assumption and an exponential time rewriting algorithm under the open world assumption are presented. Both these two algorithms are sound. |
| |
| Keywords: | Boolean query rewriting algorithms closed world assumption open world assumption |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《福州大学学报(自然科学版)》下载全文 |
