Serge Abiteboul. Towards a deductive object-oriented database language. In Proceedings of the First International Conference on Deductive and Object-Oriented Databases, pages 453-472. North Holland, Amsterdam, 1989.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....there is no easy way of parameterizing a query (resp. view definition) like the one offered in our approach. View update is defined for object preserving operators (subset of our s) Updates on derived attributes are disallowed. The inverse of view update, view maintenance, is not addressed. [1] presents a query language combining deduction with object orientation. All variables are typed and methods may occur as functional expressions within the rule body. Membership of an instance (a complex value bound to a variable) to a class can be explict or derived by a rule. However, a query ....

S. Abiteboul, "Towards a deductive object-oriented database language", Data & Knowledge Engineering, 5, 1990, pp. 263--287.

....by rules. However, the update itself may be defined by rules. Update programs have fixpoint semantics; the fixpoint can be computed by a bottomup evaluation according to a certain stratification. 1 Introduction databases has been discussed and investigated for a certain time now [Ban86, KNN89, Abi90, AK89, KL89, KLW90, DKM91] Various approaches to incorporate updates into deduction have been proposed. However, only a few of these take object orientation Fakultat fur Informatik, TU Braunschweig, W 3300 Braunschweig, Germany Permission to copy without fee all or part of this material ....

Serge Abiteboul. Towards a deductive object-oriented database language. Data & Knowledge Engineering, 5(2):263--287, 1990.

....(6) P (i 2 : i 1 :a i 1 :b) P (i 1 :a) P (i 1 :b) 7) P (i 1 : i 1 :a i 1 :b) P (i 1 :a) P (i 1 :b) which agrees with our intuitions. 7) blocks the paradox of free choice permission. 1.3. Active objects Formalization of the concept of an object is now receiving increasing attention [1, 4, 7, 22, 32]. Although there is as yet no formal definition of what an object is that is accepted by the database research community, there is increasing consensus that at least the concepts of encapsulation of state and behavior, and the use of globally unique object identifiers are essential [3] We will ....

S. Abiteboul, "Towards a Deductive Object-Oriented Database Language," Data and Knowledge Engineering 5, pp. 263-287 (1990).

.... several researchers have proposed the integration of production rule languages (traditionally used in expert system shells) within database environments [8] 11] 19] 22] 23] 25] 26] 30] while others have studied the possibility of adding deductive capabilities to database systems [1], 2] 4] 5] 20] 21] 28] As a result of these studies, advanced research prototypes have been produced (e.g. LDL , Coral, Starburst, Postgres) Moreover, recent releases of some commercial database management systems already support active rule computation with varying levels of ....

.... t5 p7 Vialli fforwardg t1 p8 Baggio fforwardg t2 p9 Pagliuca fgoalkeeperg t3 p11 Maldini fdefenseg t2 team name city coach t1 juve Turin Lippi t2 milan Milan Capello t3 inter Milan Bianchi t4 lazio Rome Zeman t5 parma Parma Scala match home vis score scorers m1 t1 t2 [1 0] p7 m2 t2 t3 [2 0] p11,p8 m3 t3 t4 [0 1] p1 m4 t1 t4 [1 1] p7,p1 Fig. 1. An ODM database instance and oid s, using the built in functions in F and the type constructors in T. Thus, each term has always associated an ODM type. An object specification is a syntactic of the form C(o id ; ....

[Article contains additional citation context not shown here]

S. Abiteboul. Towards a deductive object-oriented database language. Data and Knowledge Engineering, 5:263--287, 1990.

.... active computations, that is, manipulations of data to be executed automatically whenever certain events occur [5, 6, 7, 10, 13, 14, 15, 16, 17] on the other hand the use of logic based rule languages for expressing, in a declarative way, complex database queries and deductive computations [1, 2, 3, 4, 11]. From a practical point of view, the integration of these paradigms (active and deductive) into a unique homogeneous framework would clearly represent a further important improvement [18] Indeed, the two paradigms present strong similarities since they are both based on rules that, roughly ....

S. Abiteboul. Towards a deductive object-oriented database language. Data and Knowledge Engineering, 5:263--287, 1990.

....then adapt the optimized form generated at the metalevel to this particular instance. Our results, which concentrate on the aggregation and classification abstractions, complement the work on type inferencing (i.e. generalization hierachies) in object oriented database languages [KLW90,ABIT90,HK87b] and KL One like knowledge representation languages [BBMR89] it is our final goal to integrate these aspects in the same framework as presented here. 2. Relational Simplification Techniques Simplification techniques for integrity constraints within relational databases have first been ....

Abiteboul,S. (1990). Towards a deductive object-oriented database language. Data & Knowledge Engineering 5, 1990.

....techniques and relational databases. Deductive databases extend the expressive power of the relational databases by means of rules for deduction and recursion. In recent years, deductive databases have been extended to subsume complex value databases [3, 6, 8, 13, 14, 17] and object databases [1, 4, 7, 12, 11, 15, 16]. Rules in deductive databases are used to deduce information (new facts) from the data that is stored in the database. A rule is an expression of the form: A : L1, Ln where L1, Ln is the body of the rule and used for premises and A is head of the rule and used for conclusions. It is ....

S. Abiteboul. Towards a Deductive Object-Oriented Database Language. Data and Knowledge Engineering, 5(2):263-287, 1990.

....systems) retaining, at the same time, the efficient performances in managing large amounts of data shown by traditional database environments. Interesting directions of this research include the efforts aimed at enriching (both relational and complex object) databases with deductive capabilities [1, 4, 5, 12], at integrating production rules (traditionally used in expert systems) in database environments [11, 15, 16, 17, 20] and finally at designing update languages better suited than the traditional ones for these new and advanced frameworks [2, 13, 10] All these efforts have already pro This work ....

....Vialli fforward,midfieldg #t1 #p3 Baresi fdefenseg #t2 #p4 Gascoigne fmidfield,forwardg #t4 #p7 Schillaci fforwardg #t3 team name city owner #t1 juve Turin Agnelli #t2 milan Milan Berlusconi #t3 inter Milan Pellegrini #t4 lazio Rome Cragnotti match home vis. score scorers #m1 #t1 #t2 [1 0] #p3,#p1 #m2 #t2 #t3 [0 2] #p7,#p7 #m3 #t3 #t4 [0 1] #p4 Figure 1: An ODM database instance o denotes its oid and allows to distinguish it from the other objects stored in the database, whereas c(o) denotes its extension, that is, its actual value. An instance can be viewed as a set of ....

[Article contains additional citation context not shown here]

S. Abiteboul. Towards a deductive objectoriented database language. Data and Knowledge Engineering, 5:263--287, 1990.

....each invocation of the rules against the same database. This implies that an oid cannot be the result of a random function. Instead, the oid has to be tied to the values where it comes from, so that if the same values are used again, the result will be the same oid. Existing languages such as IQL [1,4] and partly F Logic [9,10] rely on the value of the virtual object for oid generation. In other words, the generation function has its input parameters in the variables of the rule head. IQL takes all head variables as input, while F Logic uses a skolem function, thus considering only the ....

....the best of the knowledge of the system [14] Rule based OO languages have not been any further in solving the issues. They let users specify the type inclusion for the derived class, as well as the population inclusion. A run time checking is needed for the consistency of the two specifications [1, 9]. In this section we present our approach to improve existing solutions of the classification issue. The typing issue will be discussed in a forthcoming paper. Our objectives on classification are: 1) to support view definition with a complete and standard manipulation language. Users should be ....

Abiteboul S., "Towards a Deductive Object-Oriented Database Language", Data & Knowledge Engineering, Vol. 5 (1990), 263-287

....In the past few years, a lot of efforts have been made to integrate deductive and object oriented databases to gain the best of the two approaches. A number of deductive object oriented database languages have been proposed, such as O logic [31] revised O logic [25] C logic [19] IQL [5] IQL2[1], F logic [24] LOGRES [16] LLO [30] LOL [14] Datalog method [6] DLT [10] Gulog [20] Coral [36] and Rock Roll [12] However, none of these proposals have achieved the objectives of providing the necessary expressive power for data and knowledge applications in a declarative fashion ....

....assembly cost and mass increment of a composite part. Because of inadequate support of sets, none of the proposed deductive object oriented languages are powerful enough to perform this task declaratively, including the most powerful language F logic. In languages such as Rock Roll [12] and IQL2 [1], this task can be done, but only by resorting to a low level imperative program rather than a high level declarative program. y Recommended by Nicole Bidoit 1 2 Mengchi Liu On the other hand, powerful set representation mechanisms have been proposed in valueoriented deductive database ....

[Article contains additional citation context not shown here]

S. Abiteboul. Towards a deductive object-oriented database language. Data and Knowledge Engineering, 5(2):263--287 (1990).

....names (optional) as well as the cardinalities near the relationship types and the reverse cardinalities on the other side. Arrows represent the is a link between entity types. Dashed lines represent the may be a link between entity types. 4 ERCLog language follows the stream of research of [1] where complex typed terms are used to represent the complex structured values, typed functions play the role of methods. Types of ERCLog are extended to include cardinalities and reverse cardinalities, thus the distinction between mono and multi valued types is erased. The rule based language ....

....a new oid is created to associate the newly computed tuple to form an object of the derived entity type family. 3.1.1. OID generation There are two kinds of oid generation mechanisms have previously proposed for the rule created objects [7] 1) the oids are created by the values of facts [1,4,14] , and (2) the oids are created by the proofs of the facts [8,9] With the former mechanism, the superfluous identity is avoid in the first place, but it is argued that no 6 information of the proof of the fact is recorded in the oid. On the contrary, the second mechanism creates oids exactly ....

[Article contains additional citation context not shown here]

S.Abiteboul, Towards a Deductive Object-Oriented Database Language. Data & Knowledge Engineering 5 (1990)

....[24] which provide no direct support for relations, non first normal form relations are directly representable in ROL using functor objects, and traditional deductive database languages such as Datalog and LDL (without grouping) are subsumed as special cases in ROL. Languages such as IQL [6] IQL2 [2], and LOGRES [12] also support relations. However, their relations are strictly separated from classes so that relations can contain object identifiers but object identifiers cannot have relationships as attribute values and relationships cannot contain other relationships. Support for ....

.... ROL rules: int(s(X) int(X) ancestor(X; Y ) parent(X; Y ) ancestor(X; Y ) parent(X; Z) ancestor(Z; Y ) book deal(fX; Y; Zg) book(X; Px) book(Y; Py) book(Z; P z) X 6= Y; X 6= Z; Y 6= Z; Px Py P z 100 In Orion [22] O 2 [17] ODMG 93 [11] Fibonacci [4] IQL [6] IQL2 [2], and LOGRES [12] an object identifier together with all its attribute values are viewed as an object, which differs from the notion of object in ROL. 3. Classes, Instances, and Attribute Declarations Objects often share common attributes. In ROL, the user must organize objects using classes. ....

S. Abiteboul. Towards a deductive object-oriented database language. Data and Knowledge Engineering, 5(2):263--287, 1990.

....In the past few years, a lot of efforts have been made to integrate deductive and object oriented databases to gain the best of the two approaches. A number of deductive object oriented database languages have been proposed, such as O logic [29] revised O logic [22] C logic [17] IQL [4] IQL2[1], F logic [21] LOGRES [14] LLO [28] LOL [13] Datalog method [5] DLT [9] Gulog [19] and Rock Roll [10] Object identity is useful for supporting object sharing and update management. However, using object identifiers for every object is burdensome even in pure object oriented databases ....

....determines o 0 as in the relational model, and it can be a value, an object identifier, a functor object or a complete set. As in the relational model, we do not allow o (the key) to be a partial set as it is incomplete. Here l corresponds to data function of COL [2] and method of IQL2 [1] and F logic [21] Arithmetic, set and comparison expressions in ROL are defined as in the standard arithmetic and settheoretic theories. ROL is a rule based language. We now introduce rules. A rule is of the form A : L 1 ; Ln , where the head A is a non negative object expression and ....

S. Abiteboul. Towards a deductive object-oriented database language. Data and Knowledge Engineering, 5(2):263--287, 1990.

....complex objects to be formed using the tuple and set constructors. Object oriented databases [7, 11, 12, 16, 17, 21, 24, 26] extends data modeling power of the relational databases by means of object identity, complex objects, classes, class hierarchies, and inheritance. Deductive databases [1, 5, 9, 10, 13, 19, 23, 28, 31, 33, 34, 37, 36, 40, 41, 42] extend the expressive power of the relational databases by means of rules for deduction, recursion and declarative querying. In this paper, we examine how these new database technologies can be used to store object oriented graphic data and discuss the related problems. We use the following ....

....on the traditional relational data model which imposes first normal form constraint and is found inadequate for many advanced database applications. In recent years, deductive databases have been extended to subsume complex object databases [4, 8, 14, 25, 28, 34] and object oriented databases [1, 5, 9, 10, 23, 22, 29, 31, 40]. For simplicity, we only discuss deductive complex object databases in this section. Extension of the discussion to deductive object oriented databases is straightforward. In a deductive database, we can represent data either extensionally using facts or intensionally using rules. To specify ....

S. Abiteboul. Towards a deductive object-oriented database language. Data and Knowledge Engineering, 5(2):263-- 287, 1990.

....and object identity, complex objects, classes, class hierarchy, property inheritance with overriding and schema from object oriented approach. A number of deductive object oriented database languages have been proposed, such as O logic [17] revised O logic [11] C logic [8] IQL [2] IQL2[1], Flogic [10] LOGRES [7] LLO [16] LOL [6] CORAL [19] Datalog method [3] DLT [4] Gulog [9] and Rock Roll [5] However, most of these languages stay at the theoretical level. Some of them, such as F logic, are technically too complicated and it is far from clear how they could be ....

S. Abiteboul. Towards a Deductive ObjectOriented Database Language. Data and Knowledge Engineering, 5(2):263-287, 1990.

....(declarative) manipulation of objects. In fact, an increasing number of object oriented database systems support or plan to support queries, for example, ORION, O2, GemStone, and IRIS. 6 On the deductive database side, tendencies to acknowledge explicit procedurality can be observed, e.g. [Abi90]: a declarative way of writing programs is not a goal in itself. An application program consists in sets of rules (i.e. small pieces of declarative programs) organized into a transaction using primitives providing explicit control. Recently language proposals such as GLUE [Phi90] and ....

S. Abiteboul: "Towards a deductive object-oriented database language", Data and Knowledge Engineering, 5(4), 1990, 263-287

....IQL, which is an extension of COL. The authors describe an object based data model and introduce IQL, which they describe as a mathematical model of computation with types and a useful high level query language. Most significantly, IQL treats inheritance as a specialization of union types. In [1], Abiteboul has described another language based on the model that is used in IQL. The language is built around the COL and IQL languages and separates the schema and instance. The language has a deductive core with additional elaborate control structures. A fixpoint semantics is provided for the ....

....negation. Although this provides an evaluation procedure for deductive object oriented languages, it provides little insight into the semantics of such languages. Of the approaches where the aim is to build a system, 4] does not address inheritance, 4] and [6] do not address overriding, and [1, 4, 6] and [22] do not address multiple inheritance. 2.4 Summary In this chapter, we first describe concepts and current research in the area of deductive databases, and then we describe the key concepts of object oriented databases. Deductive databases do not significantly improve the data modeling ....

[Article contains additional citation context not shown here]

S. Abiteboul. Towards a deductive object oriented database language. Data and Knowledge Engineering, 5:263--287, 1990.

....In the past few years, a lot of efforts have been made to integrate deductive and object oriented databases to gain the best of the two approaches. A number of deductive object oriented database languages have been proposed, such as O logic [20] revised O logic [15] C logic [11] IQL [3] IQL2 [1], Flogic [14] LOGRES [9] LLO [19] LOL [8] DLT [5] Gulog [12] and Rock Roll [6] However, none of these proposals have achieved the objective of providing the necessary expressive power for data and knowledge applications in a declarative fashion with a well defined logical semantics for ....

S. Abiteboul. Towards a deductive object-oriented database language. Data and Knowledge Engineering, 5(2):263--287, 1990.

....and compared with the algebra and the safe calculus. LDL has also been extended to deal with set valued attributes ( 17] see also the chapter of this volume) Another calculus for complex objects has been presented in [10] Recent research dealing with set values in logic based languages, such as [6, 2, 7, 25, 54, 62, 64, 71, 21] was carried out in the framework of object oriented models, but the impacts of set values are the same in an object or tuple component. Namely that the nesting of formulae into attribute positions in logical terms makes the language second order (at least syntactically) since this leads to ....

S. Abiteboul. Towards a deductive object-oriented database language. In Kim et al. [65], pages 419--438.

....and object oriented database systems has received considerable attention over the past few years. A number of deductive object oriented database languages have been reported, such as O logic [Mai86] revised O logic [KW93] C Logic [CW89] F logic [KL89, KLW90] COL [AG91] OIL [Zan89] IQL [AK89, Abi90] LOGRES [CCCR 90] LLO [LO91] LOL [BM92] L O [McC92] and Gulog [DT93] To deal with complex objects naturally and directly, proper notions are needed for sets, schema and inheritance, which normally lead to higher order logic [KL89] Unfortunately, higher order unification problem is ....

Serge Abiteboul. Towards a Deductive Object-Oriented Database Language. Data and Knowledge Engineering, 5(2):263--287, 1990.

....is extended by functional reduction, called narrowing [6] But as aforementioned our interest is on bottom up algorithms. The main contributions of our work can be summarized as follows: Computed methods of a DOOD can be considered as algorithms executed when needed, as suggested in [1, 11]. Their evaluation is based on fast functional reduction, improving efficiency but fully preserving the declarative minimal model semantics of a program. Moreover, termination of some logical programs is achieved which typically are unsafe otherwise. An earlier approach discusses reduction rules ....

S. Abiteboul. Towards a deductive object-oriented database language. In Kim et al. [9], pages 419 -- 438.

.... and the encapsulation of object structures and these methods [13, 7, 9, 10] Recently, there have been several approaches in combining logic, rule based languages, and the structural part of an object oriented database model [6, 42, 32, 25] or even integrating methods and other behavioural aspects [1, 9, 23, 24]. In this paper, we present a rule based language for the structural part of an object oriented database model. In comparison to the other approaches mentioned, there are some special features in our approach: ffl Since we are now living in a world of objects (and not in the world of values) the ....

....o = C (r(S(C) for the object set o of C. The closure of the base object relation r(S(C) is a relation r (S(C) over fCg [ I C such that r = r(S(C) C=C1 r(S(C 1 ) C=C2 Delta Delta Delta . C=Cn r(S(C n ) and C i C for all i 2 f1; ng. 2 Similar to [9, 10] or [1], object relations combine the instances of classes and their state which is the instance of the property type. We adopt this relational view because we aim at an algebra based evaluation: the algebra over object relations is a modified version of a nested relational algebra (see Chapter 7 for ....

[Article contains additional citation context not shown here]

S. Abiteboul. Towards a deductive object-oriented database language. In [27], pages 419--438, 1989.

....relationship between the answer sets of two queries. Previous integration efforts only concentrated on two of the three aspects of queries. Similar to our approach, CoCoon [23] integrates concepts with classes but with a fixed and very simple type system (only lattice of attribute names) [1] presents a query language combining deduction with object orientation. An integration of deductive rules and concept languages is investigated in [11] Views in the object oriented query language XSQL [18] are quite similar to query classes by seperating the signature of the answer objects from ....

S. Abiteboul, "Towards a deductive object-oriented database language", Data & Knowledge Engineering, 5, 1990, pp. 263--287.

No context found.

Serge Abiteboul. Towards a deductive object-oriented database language. In Proceedings of the First International Conference on Deductive and Object-Oriented Databases, pages 453-472. North Holland, Amsterdam, 1989.

No context found.

S. Abiteboul. Towards a deductive object-oriented database language. Data and 35 Knowledge Engineering, 5:263--287, 1990.

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