计算机工程与应用 ›› 2014, Vol. 50 ›› Issue (14): 121-126.

• 数据库、数据挖掘、机器学习 • 上一篇    下一篇

视图确定性问题及其研究进展

郑黎晓1,常青玲2,3,徐世廷2   

  1. 1.华侨大学 计算机科学与技术学院,福建 厦门 361021
    2.中国科学院 计算机网络信息中心,北京 100190
    3.中国科学院大学,北京 100190
  • 出版日期:2014-07-15 发布日期:2014-08-04

View determinacy and its research progress

ZHENG Lixiao1, CHANG Qingling2,3, XU Shiting2   

  1. 1.College of Computer Science and Technology, Huaqiao University, Xiamen, Fujian 361021, China
    2.Computer Network Information Center, Chinese Academy of Sciences, Beijing 100190, China
    3.University of Chinese Academy of Sciences, Beijing 100190, China
  • Online:2014-07-15 Published:2014-08-04

摘要: 基于视图的查询回答问题在数据管理方面有广泛的应用。为了形式化地描述一组视图V是否含有足够的信息来回答用户提出的一个查询Q,研究人员近期提出了“视图确定性”的概念。介绍了视图确定性相关的研究问题,对比其与查询重写之间的关系,分析出问题的主要研究维度,总结已有的研究成果并指出存在的问题。同时,对未来的研究趋势进行了展望。

关键词: 视图确定性, 查询回答, 复杂度, 查询语言

Abstract: The problem of answering queries using views arises in a wide variety of data management applications. From the information-theoretic perspective, a notion of determinacy has been recently introduced to formalize the intuitive notion that whether a set of views V is sufficient to answer a query Q. This paper first introduces relevant concepts of view determinacy and its differences with query rewriting, then analyzes the main research dimensions and presents current research results as well as open problems. Finally, the paper discusses the future research directions of view determinacy.

Key words: view determinacy, query answering, complexity, query languages