H. Decker, E. Teniente, T. Urp. How to Tackle Schema Validation by View Updating. In Proceedings of EDBT'96: 535-549, LNCS 1057, Springer, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of them, constraint satisfaction, is well studied: How to check whether all integrity constraints are satisfied by a given database state, or whether they remain satisfied by the new state resulting from a transaction. The other issue, constraint satisfiability, was pointed out and discussed in [6, 7, 4, 20, 12]: How to ensure that the integrity constraints can be satisfied by any database state at all and in particular by interesting ones. This may be prevented by a design flaw in the schema. Constraint satisfiability is an essential prerequisite for the population phase. If the schema designer has ....

.... is our way to express :9X department (X) employee(X) 1) Departments and employees are different entities: 8X department (X) employee(X) 2) The manager X of a department Y is also a member of this department: 8X 8Y leads(X; Y ) member (X; Y ) 2 But it differs from the approach in [12], which is based on abduction rather than model generation. 3) A member X of a department Z works for the manager Y of this department: 8X 8Y 8Z member (X; Z) leads(Y; Z) works for(X; Y ) 4) Every employee X is a member of some department Y: 8X employee(X) 9Y department (Y ) member (X; ....

H. Decker, E. Teniente, and T. Urp'i. How to tackle schema validation by view updating. In 5th Int. Conf. on Extending Database Technology (EDBT), pages 535--549. Springer LNCS 1057, 1996.

....is true in D 2 . However, it seems daring to call integrity satisfied in this example, as a violation prevalent semantics such as [TK] would. To call integrity satisfied in this example is questionable also because IC might easily be considered unsatisfiable, independent of the database (cf. BDM] [DTU]) Anyway, the sustained model of D 2 gives an acceptable meaning to D 2 by assigning unknown to each literal, which suggest that also each of the constraints in IC should be considered unknown, i.e. neither satisfied nor violated. 2.3 A three valued view of database integrity In the ....

Decker, Teniente, Urpí: How to tackle schema validation by view updating, Proc. 5th EDBT, Springer, 1996.

No context found.

H. Decker, E. Teniente, T. Urp. How to Tackle Schema Validation by View Updating. In Proceedings of EDBT'96: 535-549, LNCS 1057, Springer, 1996.

....method for checking set containment of inequality queries, using a theory of formula subsumption, and set it o against the proposal discussed in this paper. Also, we intend to investigate the applicability of the QCC approach to validating various database schema properties, as de ned in [8], such as the redundancy of integrity constraints, which involves a generalization of the concept of query containment with regard to database integrity. Also, it should be interesting to target an extension of QCC to other collection types, e.g. the resource oriented collections of Linear ....

Hendrik Decker, Ernest Teniente, and Toni Urp. How to tackle schema validation by view updating. In Extending Database Technology (EDBT'98), LNCS 1057, pages 535-549. Springer-Verlag, 1996.

....ours. Their method is based on extending planning techniques with a satisfiability tester [BDM88] However, as we will show in this paper, these properties can be checked by using some of the current planning methods. This paper extends our previous work on validation in the context of databases [DTU96], which focused on the use of view updating for validating a database schema, without taking the predefined transactions or operations into account. It also extends our work reported in [CO92] where we proposed a concrete planning method for explaining the reachability of a final state, departing ....

Decker, H.; Teniente, E.; Urpí, T. "How to Tackle Schema Validation by View Updating", To appear in proc. of the EDBT'96, Avignon, France, 1996.

....is not satisfied, it may be the case that the active database is ill specified and its design should be revised. In general, this may be due to the specification of active rules, operations, or both. The set of properties we define in this paper refers only to active rules. In our previous work [DTU96, CTUF96] we used a similar approach for validating the schema and the operations. 4.1 Applicability The first property that an active rule should satisfy is its applicability. An active rule is applicable if it may be triggered and its condition may hold. However, since it could be the case that ....

....Validation has also been investigated in the field of passive databases (e.g. BDM88, IKH92, CDM93, GSUW94] These proposal handle different schema validation tasks by means of different techniques. The approach proposed in this paper extends our previous work in the context of passive databases [DTU96], which focused on the use of view updating for validating a database schema without taking into account predefined transactions (operations) nor active rules. It also extends our work reported in [CTUF96] which showed the of planning for validating a database schema with a set of predefined ....

Decker H.; Teniente E.; Urpi T. "How to Tackle Schema Validation by View Updating", Proc. EDBT96, Avignon, 1996, pp. 535-549

....interacting with the Designer Interface module, which performs a lexical and syntactical analysis of the database schema once the database is defined. FOLRE provides also a tool for validating the deductive database schema definition: the Validator; which allows the designer to ask questions (see [DTU96]) about the accomplishment of certain desirable properties of the schema like schema satisfiability, predicate liveliness or redundancy of constraints. Answers to these questions provide him her with information on whether the schema correctly describes the users intended needs. A validated ....

Decker, H.; Teniente, E.; Urpí, T. "How to Tackle Schema Validation by View Updating", Int. Conf. on Extending Database Technology (EDBT), Avignon, France, 1996, pp. 535-549.

....0 ary predicate satisfiable shows that the database schema on which the insert request has been executed is satisfiable; a finitely failed attempt to insert satisfiable shows the unsatisfiability of the schema. Thus, the downward method is also used at definition time for validation purposes. See [DTU96] for the details of our approach to validation. A validated schema is stored on disk by means of the ECLiPSe Interface. In this way, ECLiPSe gives us the support for storing disk resident data efficiently. It is important to note that this is the only module that depends on the chosen back end, ....

Decker, H.; Teniente, E.; Urpí, T. "How to Tackle Schema Validation by View Updating", Int. Conf. on Extending Database Technology (EDBT), Avignon, France, 1996, pp. 535-549.

....two queries in terms of a derived (view) predicate. Then, checking containment is performed by requesting the insertion of that predicate. If some solution exists the predicate can be satisfied and, therefore, the expressed relationship holds. This new approach is based on the seminal work of [DTU96], which uses view updating to perform database schema validation tasks, such as schema satisfiability or redundancy of integrity constraints. The reformulation of the containment problem we propose is similar to that of [LMSS93, LS95] which translates query containment to the problem of query ....

H. Decker, E. Teniente, T. Urpí: "How to tackle schema validation by view updating", Proceedings of the 5 th International Conference on Extending Database Technology (EDBT'96). Lecture Notes in Computer Science, Vol. 1057, Springer, 1996, pp. 535-549.

....translations is considerably reduced since the extensional translations characterised by a corresponding single intensional translation are processed together. In recent years, several proposals have shown how consistent view updating can be applied to solve many different problems. For instance, [DTU96] reports how to tackle database schema validation by view updating, DMMP91, Cos93] use view updating as a core of their corresponding planning systems, TO95] outlines how a view updating method can be used to repair an inconsistent database and [TU95] argues that several database updating ....

....the treatment of infinite domains since an intensional translation may characterise infinite extensional ones. Moreover, intensional translations are obtained in a more efficient way since the search space needed to generate them is considerably reduced. As we pointed out in [TU95] and in [DTU96], we think that improvements in consistent view updating can be applied in many different problems that may be formulated in terms of view updating like database schema validation, repairing of inconsistent databases or as a core of a planning system. We believe that our approach represents a ....

Decker, H.; Teniente, E.; Urpí, T. "How to Tackle Schema Validation by View Updating", Proc. of the EDBT'96, Avignon, France, 1996, pp. 535-549.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC