On the Complexity of View Update Analysis and Its Application to Annotation Propagation

被引:28
作者
Cong, Gao [1 ]
Fan, Wenfei [2 ]
Geerts, Floris [3 ]
Li, Jianzhong [4 ]
Luo, Jizhou [4 ]
机构
[1] Nanyang Technol Univ, Sch Comp Engn, Div Informat Syst, Singapore 639798, Singapore
[2] Univ Edinburgh, Sch Informat, Lab Fdn Comp Sci, Edinburgh EH8 9AB, Midlothian, Scotland
[3] Univ Antwerp, Dept Comp Sci, B-2020 Antwerp, Belgium
[4] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150001, Peoples R China
基金
英国工程与自然科学研究理事会;
关键词
Annotation; view updates; view maintenance; SPJU queries; PROVENANCE;
D O I
10.1109/TKDE.2011.27
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper investigates three problems identified in [1] for annotation propagation, namely, the view side-effect, source side-effect, and annotation placement problems. Given annotations entered for a tuple or an attribute in a view, these problems ask what tuples or attributes in the source have to be annotated to produce the view annotations. As observed in [1], these problems are fundamental not only for data provenance but also for the management of view updates. For an annotation attached to a single existing tuple in a view, it has been shown that these problems are often intractable even for views defined in terms of simple SPJU queries [1]. We revisit these problems by considering several dichotomies: 1) views defined in various subclasses of SPJU, versus SPJU views under a practical key preserving condition; 2) annotations attached to existing tuples in a view versus annotations on tuples to be inserted into the view; and 3) a single-tuple annotation versus a group of annotations. We provide a complete picture of intractability and tractability for the three problems in all these settings. We show that key preserving views often simplify the propagation analysis. Indeed, some problems become tractable for certain key preserving views, as opposed to the intractability of their counterparts that are not key preserving. However, group annotations often make the analysis harder. In addition, the problems have quite diverse complexity when annotations are attached to existing tuples in a view and when they are entered for tuples to be inserted into the view.
引用
收藏
页码:506 / 519
页数:14
相关论文
共 36 条
[1]  
Abiteboul Serge, 1995, FDN DATABASES, DOI DOI 10.5555/551350
[2]  
Agosti M, 2004, LECT NOTES COMPUT SC, V3232, P244
[3]  
[Anonymous], 2011, SQL SERV
[4]  
[Anonymous], 2011, SQL REF
[5]  
[Anonymous], 2011, IBM DB2 UN DAT SQL R
[6]   UPDATE SEMANTICS OF RELATIONAL VIEWS [J].
BANCILHON, F ;
SPYRATOS, N .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1981, 6 (04) :557-575
[7]   An annotation management system for relational databases [J].
Bhagwat, D ;
Chiticariu, L ;
Tan, WC ;
Vijayvargiya, G .
VLDB JOURNAL, 2005, 14 (04) :373-396
[8]  
Buneman P, 2001, LECT NOTES COMPUT SC, V1973, P316
[9]  
Buneman P., 2002, P ACM S PRINCIPLES D, P150, DOI DOI 10.1145/543613.543633
[10]   On the Expressiveness of Implicit Provenance in Query and Update Languages [J].
Buneman, Peter ;
Cheney, James ;
Vansummeren, Stijn .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2008, 33 (04)