Institutional Repository
| determinacy and rewriting of conjunctive queries over unary database schemas | |
| Zheng Lixiao; Chen Haiming | |
| 2011 | |
| Conference Name | 26th Annual ACM Symposium on Applied Computing, SAC 2011 |
| Source | Proceedings of the ACM Symposium on Applied Computing |
| Pages | 1039-1044 |
| Conference Date | March 21, |
| Conference Place | TaiChung, Taiwan |
| Indexed Type | EI |
| Publish Place | United States |
| ISBN | 9781450301138 |
| Department | (1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (2) Graduate University, Chinese Academy of Sciences, China |
| English 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. We say that V determines Q iff for any two databases D1, D2, V(D1) = V(D2) implies Q(D1) = Q(D2). Determinacy has been investigated for many query and view languages including first order logic (FO) and unions of conjunctive queries (UCQ) and a considerable number of cases are resolved. However the problem remains open for queries and views defined by conjunctive queries (CQ) and appears to be quite challenging. In this paper we study the problem of determinacy for conjunctive queries and views over unary database schemas where each relation has only one attribute. We show that determinacy is decidable in ptime in this case. We provide syntactic characterizations for a CQ query Q to be determined by a set of CQ views V and give an algorithm for checking determinacy which runs in time O(|Q|*|V|) where |Q| and |V| are the sizes of Q and V respectively. Furthermore we show that whenever V determines Q there exists a CQ query which is an equivalent rewriting of Q using V. © 2011 ACM. |
| Keyword | Computability And Decidability Information Management Information Theory Query Processing |
| Sponsorship | ACM Special Interest Group on Applied Computing (SIGAPP); Tunghai University; Taiwan Ministry of Education; Taiwan Bureau of Foreign Trade; Taiwan National Science Council (NSC) |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/14325 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Zheng Lixiao,Chen Haiming. determinacy and rewriting of conjunctive queries over unary database schemas[C]. United States,2011:1039-1044. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| determinacy and rewr（561KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment