Jeusfeld, M., Jarke, M.: From Relational to object-oriented Integrity Simplification. Proc. of the 2nd Intl. Conf. on Deductive and Object-Oriented Databases (DOOD'91), Springer Verlag, LNCS 566 (1991) 283--295.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....However, if a unified schema was available in the CoopIS environment, then we can provide interoperability wrt the unified schema. Research in combining deductive and object oriented data models is also relevant (see, e.g. Barsalou and Gangopadhay (1992) Gardarin and Valduriez (1992) and Jeusfeld and Jarke (1991)) The Conceptbase system by Jeusfeld and Jarke (1991) expresses object oriented constructs in the form of a deductive database system. Gardarin and Valduriez (1992) propose a language that is suitable for relational, deductive and object oriented data models. Although the goals of these ....

....CoopIS environment, then we can provide interoperability wrt the unified schema. Research in combining deductive and object oriented data models is also relevant (see, e.g. Barsalou and Gangopadhay (1992) Gardarin and Valduriez (1992) and Jeusfeld and Jarke (1991) The Conceptbase system by Jeusfeld and Jarke (1991) expresses object oriented constructs in the form of a deductive database system. Gardarin and Valduriez (1992) propose a language that is suitable for relational, deductive and object oriented data models. Although the goals of these researchers are different, they provide insight into knowledge ....

Jeusfeld, M. and M. Jarke (1991) "From relational to object-oriented integrity simplification," Proceedings of the Second International Conference on Deductive and Object-Oriented Databases.

....on the respective base relation, we are in fact performing deduction as well. We would like to call this kind of deduction update driven inference. In connection with deductive databases, this other mode of inference has been investigated mainly for integrity checking purposes up till now [BMM91, Dec86, KSS87, Kue91, JJ91, LST87, Oli91, VBK91]. But there is a much wider class of potential applications of update driven inference which have been mostly studied outside the mainstream of deductive database research. Maybe the most important of these applications is the maintenance of materialized views, i.e. of rule defined relations the ....

M. Jeusfeld and M. Jarke: "From Relational to Object-Oriented Integrity Simplification", Proc. 2nd Intern. Conf. on Deductive and Object-Oriented Databases (DOOD), Munchen, Dec. 1991

....maintenance has received considerable attention in the literature of the past decade. Most proposed techniques for integrity maintenance rely on monitoring by a generic application independent program that verifies that updates do not violate semantic constraints [Nic82] LST86] BDM88] JJ91] Cho92] Ple93a] Ten95] Ple95] Another popular approach is based on maintenance by transactions [Sto75] GM79] Lip90] CW90] LTW93] The former technique relieves the user from the burden of implementing database transactions in a way such that no constraint is violated. The latter ....

M. Jeusfeld and M. Jarke. From Relational to Object-Oriented Integrity Simplification. In 2nd Int. Conference on Deductive and Object-Oriented Databases, pages 460--477, 1991.

....uses an approach based on abstract data types where valid time and transaction time can be modelled using appropiate functions. The consistency of the database is enforced through additional constraints. A query language based on nested loops is proposed to query the database. Jeusfeld and Jarke [JJ91] analyze possibilities to check and simplify static constraints using update operations within an object model without complex objects. We examine some approaches in more detail. Won Elmasri. In [WE96] the interpretation of bitemporal relations is addressed. In order to clarify which temporal ....

M. Jeusfeld and M. Jarke. From Relational to Object-Oriented Integrity Simplification. In

....including corresponding syntactic constructs and semantics. Nevertheless, there exists also another approach to the integration of these different paradigms: the usage of transformations. In the latter case, the certain set of transformations from OO or ER framework to logical language is defined [11, 19] or specifications in logical language are transformed to some OO language [4] Problems are solved on the basis of the target language produced by transformations. In our work, we have been inspired from the usage of transformations between two different languages representing two different views ....

....are solved on the basis of the target language produced by transformations. In our work, we have been inspired from the usage of transformations between two different languages representing two different views of IS to achieve more general framework for IS modeling. In contrast to the others [11, 19, 4], we do not use one target language but make the transformations play very active role within our approach. We rely on co operative work of both languages. As a result, a user of our approach is equipped with two co existent languages communicating by means of transformations. This principle makes ....

M. Jeusfeld, M. Jarke, From relational to object-oriented integrity simplification, Proc. of the 2nd Int. Conf. on Deductive and ObjectOriented Databases, Munich, Dec., 1991.

....substantially higher than that of verifying properties that refer to a single state only or to pairs of consecutive states. So far, the research community has dealt with the problem of maintaining semantic integrity in contexts such as relational, deductive or object oriented databases [4] 5] [13]. On the other hand, research in temporal databases has almost exclusively adopted a relational model [15] 7] 12] 25] Work on temporal deductive databases has mainly dealt with the problem of finitely representing infinite temporal properties [14] and with the evaluation of temporal logic ....

.... =Address 8t=Time (address(u; s; t) D addr(d; s 0 ; t) s = s 0 ) works in(u; d; t) at 1993: 4 A formula is rectified if no two quantifiers introduce the same variable [4] 5 This class of constraints is equivalent to both the restricted quantification form of [4] and the range form of [13]. 2.4 Satisfaction of Temporal Assertions A Telos knowledge base, KB, comprises a set of propositions, KBP , defining the validity of predicates over (history) time intervals, as well as a set, KBR , of deductive rules and a set, KB I , of integrity constraints. Definition1. An object variable ....

[Article contains additional citation context not shown here]

M. Jeusfeld and M. Jarke. From Relational to Object-Oriented Integrity Simplification. In Proceedings of DOOD-91, pages 460--477, 1991.

....An Extensible Framework for Repairing Constraint Violations methods that efficiently check integrity constraints for violations. Several proposals on integrity maintenance have been made for relational, deductive and object oriented databases (Grefen and Apers 1993, Widom 1994, Celma et al. 1994, Jeusfeld and Jarke 1991). Nearly all of these approaches are passive, i.e. in case of constraint violations a rollback of the complete transaction is performed. For several applications, however, such a drastic action is insufficient. This holds in particular for nowadays emerging database applications like engineering ....

M. Jeusfeld, M. Jarke (1991) From Relational to Object-Oriented Integrity Simplification. In C. Delobel, M. Kifer, Y. Masunaga (eds.), Deductive and Object-Oriented Databases --- Proceedings DOOD'91, 460--477, Lecture Notes in Computer Science 566, Springer-Verlag, Berlin.

....methods developed by Decker (1986) Kowalski et al. 1987) Lloyd et al. 1987) Moerkotte and Lockemann (1991) W thrich (1993) Pastor and Oliv (1994) Asirelli et al. 1996) Lee and Ling (1996) deal with deductive databases. In the area of object oriented databases we can refer the works of Jeusfeld and Jarke (1991), Palopoli and Torlone (1992) Siebes and Van der Voort (1992) Karadimce and Urban (1993) Examples in the area of active databases are the methods developed by Siebes and Van der Voort (1992) Karadimce and Urban (1993) Ceri et al. 1994b) Deductive object oriented databases are considered by ....

Jeusfeld, M. and Jarke, M. (1991) From relational to object-oriented integrity simplification. Proc. of the 2nd Int. Conference on Deductive and ObjectOriented Databases, Munich, Germany, 460-77.

....of integrity maintenance has received considerable attention in the literature of the past two decades. Most proposed techniques for integrity maintenance rely on monitoring by a generic application independent program that verifies that updates do not violate semantic constraints [20] 15] 3] [10], 5] 22] 31] 24] Another popular approach is based on maintenance by transactions [30] 8] 14] 4] 11] The former technique relieves the user from the burden of implementing database transactions in a way such that no constraint is violated. The latter requires that the ....

M. Jeusfeld and M. Jarke. From Relational to Object-Oriented Integrity Simplification. In Proceedings of DOOD-91, pages 460--477, 1991.

....define valid database extensions as add ons to the database schema. Every local referential integrity constraint is specified by a separate and complex predicate. The predicates may be transformed into production rules which get executed whenever operations modifying an object reference occur [5, 11]. 2. Using pre and postconditions of type specific operations. Every operation modifying an object reference checks in its pre or post condition whether the intended update is valid [18] 3. Using active database system concepts. Event condition action rules define how updates of object ....

M. Jeusfeld and M. Jarke, "From Relational to Object-Oriented Integrity Simplification," in Proc. of 2nd Int.Conf on Deductive and Object-Oriented Databases, ed. Delobel, Kifer, and Masunaga, pp. 460-477, Springer LNCS 566, 1991.

....steps at times when system performance is not as critical. 1. 2 Research Issues and Existing Approaches So far, the research community has dealt with the problem of maintaining semantic integrity in contexts such as relational, deductive or object oriented databases [Sto75] Bry87] CW90] JJ91] A detailed overview of existing methods can be found in [Ple91] A considerable amount of work exists also on the view update problem. The integrity maintenance problem is related to the view update problem: constraints are regarded as views that must be kept empty. Thus, enforcing constraints ....

....and helps identifying the appropriate actions for enforcement, it does not consider deductive rules. Moreover, it is not applicable to multiple constraints. Knowledge Bases The compilation method for deductive databases [BDM88] has been extended to an objectoriented framework in [JK90] JJ91] and has been implemented in the structurally objectoriented knowledge base management system ConceptBase [EJJ 89] The method, based on the same principles as the original proposal of [BDM88] advances the latter in the following respect: triggers can be specified for and attached to the ....

[Article contains additional citation context not shown here]

M. Jeusfeld and M. Jarke. From Relational to Object-Oriented Integrity Simplification. In Proceedings of DOOD-91, pages 460--477, 1991.

....constraints. The approach to synthesis of methods, which is implemented in the NUT system, is also relevant to constraint programming (in particular, to statical analysis of constraints) Transformations from an OO representation to a logical representation and vice versa were considered in [8, 1]. In these works the problem is considered as follows. Initial problem is described in an OO language (correspondingly logical language) and then transformed into a logical (correspondingly OO) form as an internal representation. In our approach, we consider both forms in parallel without ....

M. Jeusfeld and M. Jarke. From relational to object-oriented integrity simplification. In Proc. of the 2nd International Conference on Deductive and OODB, Munchen, Germany, December 1991.

....system, developed since 1987 at the Universities of Passau and Aachen in Jarke s group, seeks to combine deductive rules with a semantic data model based on Telos. The language aspects are presented in [JS93] The system also provides support for integrity constraints; this is described in [JJ91] ConceptBase has been used in a number of applications at various universities in Europe, and is now being commercially developed. The CORAL project at U. Wisconsin, which was started in 1988, can also be traced to LDL. 7 The original impetus for the project was the development of the Magic ....

M. Jeusfeld and M. Jarke. From relational to object-oriented integrity simplification. In M. Kifer C. Delobel and Y. Masunaga, editors, Proc. Deductive and Object-Oriented Databases 91. SpringerVerlag, 1991.

No context found.

Jeusfeld, M., Jarke, M.: From Relational to object-oriented Integrity Simplification. Proc. of the 2nd Intl. Conf. on Deductive and Object-Oriented Databases (DOOD'91), Springer Verlag, LNCS 566 (1991) 283--295.

....for this purpose the original rules with respect to updates on literals occuring in the rule body. Each specialization yields a unique query literal with update parameters, supplementing the answer arguments similar to rules resulting from parameterized query classes. This specialization algorithm [26] follows the concept of relational simplification. If the example rule for WrongDrugPatient is specialized with respect to a deletion of a disease a patient is suffering from, i.e. Delete(A(p; suffers; d) the effect on the rules is as follows: WDP 1 (p; w; d) Gamma In(p; #P atient) In(w; ....

....opportunities of optimizing the query evaluation process. The axioms of the O Telos data model can be used to get a significant reduction of the number of literals to be checked for queries and as a consequence also of the number of specialized forms and triggers (ECA rules) for relevant views [25, 26]. Applying e.g. the axiom of section 3.1 which states that instantiation relationships between objects imply instantiation relationships between their source respectively destination components, all In literals in the rule generated from the query class WrongDrugPatient can be dropped. 8i; v A(i; ....

M. Jeusfeld and M. Jarke, "From relational to object-oriented integrity simplification ", in Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, LNCS 566, Springer-Verlag, pp. 460--477, 1991.

....well as the abstraction principles (classification, generalization, aggregation) of object oriented databases and also allow the specification of certain methods through deductive rules and constraints. An important design goal was that all this was achieved without leaving the Datalog framework [JJ91]; recently, other researchers have also recognized the importance of this point [ALU93] ConceptBase exploits the structural axioms in three ways: ffl At the user interface level, it offers a choice of structured frame and graph syntax in addition to the usual logical language. Unusual features ....

....which contain predicates like In(x; c) where c is a variable. Since c is bound to a class such formulas make statements about objects two (or more) instantiation levels below the class of c. A subset of these formulas can be partially evaluated whenever a new class is entered into the database [JJ91]. An example is the necessary or required category defined in many semantic data models. It can be defined as an integrity constraint of a meta class #Necessary: 8 p; c; m; d; x In:#Necessary(p) In(x; c) P (p; c; m; d) 9 y In(y; d) A(x; m; y) By partially evaluating the predicates ....

Jeusfeld M., Jarke M., "From relational to object-oriented integrity simplification ", In Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, LNCS 566, Springer-Verlag, pp. 460--477.

....abstraction level, esp. talking about items in the tools databases (production layer) in the conceptual model (conceptual model layer) From such logical rules, one can automatically derive specialized rules for the application schemata, and then reformulate them as SQL queries, views, or triggers [9]. In the WibQuS environment, each tool gets a standard SQL database system as its interface to the outside world. This gives services like recovery, atomic transactions, network transparency etc. Here, we concentrate on the role of the trader and how this 13 tool facilitates the data flow. One has ....

M. Jeusfeld, M. Jarke (1991). From relational to object-oriented integrity simplification. Proc. 2nd Intl. Conf. Deductive and Object-Oriented Databases, LNCS 566, Springer-Verlag.

....literals by all class and attribute identifiers. Now, deductive rules and integrity constraints are rewritten such that they only contain A:p, In:c and Isa literals. For the In literal, this rewriting is trivial provided the second component is a constant. Otherwise the formula is rejected (see [JJ91] for handling meta formulas which range over classes) The interesting case is the literal A. Let A(x; l; y) be a literal occurrence in a formula where x is bound to class c. Then c 0 is defined to be the lowest superclass of c that has an attribute labelled l. If there is such a c 0 at all, ....

....becomes part of the set IC in the deductive object base (OB,R,IC) The concerned attribute of A(p; suffers; s) is #suff. Note that the constraint may only become part of the deductive object base if the rewriting of the literals succeeds. Further examples with recursive deduction rules are in [JJ91]. 8 3. Queries as Classes Many proposals exist in the literature for query representation formats in the context of object oriented databases and knowledge representation systems. One group uses query languages adapted from conventional databases e.g. SQL like languages augmented by some ....

Jeusfeld,M., Jarke,M. (1991). From relational to object-oriented integrity simplification. Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, Munchen, Germany, Dec. 1991; also in: Aachener Informatik-Berichte 91-19, RWTH Aachen, Germany.

....plus some aggregation predicates like SUM and AVG. Deductive rules are used to define new predicates from existing ones. In ConceptBase, the logical sub language is a variant of DATALOG with negation. The uniform representation of objects plus well defined semantics of the logical sub language [15] are the preconditions for the extensibility of the system for various application types. Since the class instance relationship is stored explicitly in ConceptBase, an object is allowed to have multiple classes. Moreover, a class may be instance of other classes, called meta classes. Meta classes ....

Jeusfeld, M., Jarke, M.: From relational to object-oriented integrity simplification. Proc. 2nd Intl. Conf. on Deductive and Object-Oriented Databases (DOOD'91), Springer Verlag, LNCS 566 (1991) 283--295.

.... DialogueBox configure InfoBase interface component1 component2 component3 configure Kernel interface ObjProc QueryProc Query Language component1 component2 Data Model Storage Manager component3 Operating System TypeSystem WindowSystem OperatingSystem Communication In the actual data model we use [JJ91], the interface and component description literals in the above formula are managed as views on a deductive object base which essentially consists of binary relations ( attribute objects , written A(x,rel,y) organized according to an object oriented structural schema. The above figure shows the ....

....The simplest reaction is to reject this update. A more clever solution is to find out whether the old software base is re configurable: Check by forward evaluation of those configuration threads with c as condition which interfaces are no longer configurable (technique is described in [JJ91]) Try to create these violated interfaces by abduction. For detecting dangling interface objects we build the logical completion (only if halves) CLAR78] of the rules defining one configuration thread. This is justified since only such interface instantiations are considered for which at ....

Jeusfeld, M., Jarke, M. (1991). From relational to object-oriented integrity simplification. Proc. 2nd Intl. Conf. Deductive and Object-Oriented Data Bases, München, 460-477.

.... DialogueBox configure InfoBase interface component1 component2 component3 configure Kernel interface ObjProc QueryProc Query Language component1 component2 Data Model Storage Manager component3 Operating System TypeSystem WindowSystem OperatingSystem Communication In the actual data model we use [JJ91], the interface and component description literals in the above formula are managed as views on a deductive object base which essentially consists of binary relations ( attribute objects , written A(x,rel,y) organized according to an object oriented structural schema. The above figure shows the ....

....The simplest reaction is to reject this update. A more clever solution is to find out whether the old software base is re configurable: Check by forward evaluation of those configuration threads with c as condition which interfaces are no longer configurable (technique is described in [JJ91]) Try to create these violated interfaces by abduction. For detecting dangling interface objects we build the logical completion (only if halves) CLAR78] of the rules defining one configuration thread. This is justified since only such interface instantiations are considered for which at ....

Jeusfeld, M., Jarke, M. (1991). From relational to object-oriented integrity simplification. Proc. 2nd Intl. Conf. Deductive and Object-Oriented Data Bases, München, 460-477. - - 16

....The main advantage of our query language is that it completely falls into Datalog : Thus, virtually any evaluation method from this area is applicable. Optimization of rules and integrity constraints benefits from the predefined axioms of the object model by elimination of redundant predicates [15]. This also enhances the maintenance of materialized views, i.e. stored answers to a query [16] Recently, compilation of deductive rules into algebra expressions has been added to ConceptBase. It profits from the fact that the object model provides an access predicate for each class attribute. ....

M.A. Jeusfeld and M. Jarke, "From relational to object-oriented integrity simplification ", in Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, LNCS 566, Springer-Verlag, pp. 460--477, 1991.

....into the meta database. This renders two specialized versions of the constraint: #### ## #sx#5yxf. wi # #o oo# o oo#sx#Axpy #Qsxu # #hiwexh#o oo ## #sx#H yh. gi # #o oo# o oo#sx#Axpy # Qy. gi # #f. vo oo#o oo ConceptBase includes an incremental formula compiler [JJ91] which automatically generates these specialized versions. If a fact like (Consumer mandatory demand Info Sink) is removed from the meta database then the corresponding constraint will also be removed. Thereby, change of policy is technically very easy. A second pre fabricated formula is used ....

Jeusfeld, M.A., Jarke, M. (1991). From relational to object-oriented integrity simplification. Proc. 2nd Intl. Conf. Deductive and Object-Oriented Databases, LNCS 566, Springer-Verlag, pp. 460-477, 1991.

No context found.

Jeusfeld, M. and M. Jarke (1991) "From relational to object-oriented integrity simplification," Proceedings of the Second International Conference on Deductive and Object-Oriented Databases.

No context found.

Jeusfeld, M. and M. Jarke (1991) "From relational to objectoriented integrity simplification," Proceedings of the Second International Conference on Deductive and ObjectOriented Databases.

First 50 documents

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