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.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :A New Construction of EVENODD Codes With Lower Computational Complexity - 2018ABSTRACT:EVENODD codes are binary array codes for correcting double disk failures in RAID-half-dozen with asymptotically optimal encoding
PROJECT TITLE :Cost-Optimal Caching for D2D Networks With User Mobility: Modeling, Analysis, and Computational Approaches - 2018ABSTRACT:Caching well-liked files at the user equipments (UEs) provides an efficient way to alleviate
PROJECT TITLE :Design, Analysis, and Implementation of ARPKI: An Attack-Resilient Public-Key Infrastructure - 2018ABSTRACT:This Transport Layer Security (TLS) Public-Key Infrastructure (PKI) is based on a weakest-link security
PROJECT TITLE :On the Complexity of Bounded View Propagation for Conjunctive Queries - 2018ABSTRACT:The read propagation problem is a class of read update downside in relational databases [7], involving deletion and insertion
PROJECT TITLE :Fractional- Order Differentiators and Integrators with Reduced Circuit Complexity - 2018ABSTRACT:Fractional-order differentiation and integration stages are essential building blocks for performing signal processing

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry