Francois Bancilhon and Setrag Khoshafian. A calculus for complex objects. Journal of Computer and System Sciences, 38(2):326--340 (April 1989).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....area. In the database community, it was felt that the logic programming paradigm offers interesting opportunities as a database query language. This resulted in logical query languages like LDL [14] and NAIL [13] So called complex objects have recently been studied for use in database systems [7, 8]. Much of what has been proposed in those studies is derived from earlier work extending first order terms to terms [1] The latter notion has had a more direct application in programming language design [4, 2, 6] than in database systems. Still, the functionality and naturalness of deductive ....

....and experimentation, we use the specific language LIFE [2] but this implies no loss of generality. Indeed, although we formulate it using terms, our design is directly applicable to any logical query language with complex objects represented as Prolog terms or as data structures a la [7, 8], since all these models turn out to be special cases of terms. We present the theoretical view of our proposed database support of that language and discuss the results. Our theoretical design was put into practice as the basis of an experimental implementation [12] Although our experiment may ....

Francois Bancilhon and Setrag Khoshafian. A calculus for complex objects. Journal of Computer and System Sciences, 38(2):326--340 (April 1989).

....discussion and to facilitate the applicability of our results to any rule language. 3.1 Object Model and the Abstract Rule Notation We have built our framework on top of a unified object model which can be used to characterize all entities in a rule system. The basic object model is inspired by [6, 14] and is comprised of the following sets of symbols: A : attribute names, C : class names, I : identifiers, M : method names, R : rule names, V : variable names. Definition 1 (Methods) A method definition is a triple (M;P;B) where M is a method name, P is a set of parameter specifications, ....

Francois Bancihon and Setrag Khoshafian. A calculus for complex objects. In Proc. 15th ACM Symp. on Principles of Database Systems, pages 53--59, 1986.

....of sets and tuples in any order. Complex object systems sometimes support additional types, such as lists or arrays [151] and some models allow the definition of recursive types by supporting object identity [5] A number of languages have been proposed for complex object models (e.g. 1] 5] [11], 69] 103] 151] Most languages are similar in power. One difference in power is whether or not a language defines a Powerset 1 operation. Languages with Powerset are strictly more powerful than the same language without the operation [1] Another difference is the treatment (when ....

Francois Bancilhon and Setrag Khoshafian. A Calculus for Complex Objects. In Proceedings of the Symposium on Principles of Database Systems, pages 53--59. ACM, March 1986.

....area. In the database community, it was felt that the logic programming paradigm offers interesting opportunities as a database query language. This resulted in logical query languages like LDL [14] and NAIL [13] So called complex objects have recently been studied for use in database systems [7, 8]. Much of what has been proposed in those studies is derived from earlier work extending first order terms to terms [1] The latter notion has had a more direct application in programming language design [4, 2, 6] than in database systems. Still, the functionality and naturalness of deductive ....

....and experimentation, we use the specific language LIFE [2] but this implies no loss of generality. Indeed, although we formulate it using terms, our design is directly applicable to any logical query language with complex objects represented as Prolog terms or as data structures a la [7, 8], since all these models turn out to be special cases of terms. We present the theoretical view of our proposed database support of that language and discuss the results. Our theoretical design was put into practice as the basis of an experimental implementation [12] Although our experiment may ....

Francois Bancilhon and Setrag Khoshafian. A calculus for complex objects. Journal of Computer and System Sciences, 38(2):326--340 (April 1989).

....area. In the database community, it was felt that the logic programming paradigm offers interesting opportunities as a database query language. This resulted in logical query languages like LDL [14] and NAIL [13] So called complex objects have recently been studied for use in database systems [7, 8]. Much of what has been proposed in those studies is derived from earlier work extending first order terms to terms [1] The latter notion has had a more direct application in programming language design [4, 2, 6] than in database systems. Still, the functionality and naturalness of deductive ....

....and experimentation, we use the specific language LIFE [2] but this implies no loss of generality. Indeed, although we formulate it using terms, our design is directly applicable to any logical query language with complex objects represented as Prolog terms or as data structures a la [7, 8], since all these models turn out to be special cases of terms. We present the theoretical view of our proposed database support of that language and discuss the results. Our theoretical design was put into practice as the basis of an experimental implementation [12] Although our experiment may ....

Francois Bancilhon and Setrag Khoshafian. A calculus for complex objects. Journal of Computer and System Sciences, 38(2):326--340 (April 1989).

....area. In the database community, it was felt that the logic programming paradigm offers interesting opportunities as a database query language. This resulted in logical query languages like LDL [14] and NAIL [13] So called complex objects have recently been studied for use in database systems [7, 8]. Much of what has been proposed in those studies is derived from earlier work extending first order terms to terms [1] The latter notion has had a more direct application in programming language design [4, 2, 6] than in database systems. Still, the functionality and naturalness of deductive ....

....and experimentation, we use the specific language LIFE [2] but this implies no loss of generality. Indeed, although we formulate it using terms, our design is directly applicable to any logical query language with complex objects represented as Prolog terms or as data structures a la [7, 8], since all these models turn out to be special cases of terms. We present the theoretical view of our proposed database support of that language and discuss the results. Our theoretical design was put into practice as the basis of an experimental implementation [12] Although our experiment ....

Francois Bancilhon and Setrag Khoshafian. A calculus for complex objects. Journal of Computer and System Sciences, 38(2):326--340 (April 1989).

....of production systems. Thus the results presented in this paper are generally applicable to any rule language. 3.1 Object Model We have built our framework on top of a unified object model which can be used to characterize all entities in a rule system. The basic object model is inspired by [1, 4] and is comprised of the following sets of symbols: A : attribute names, C : class names, I : identifiers, M : method names, R : rule names, V : variable names. Definition 1 (Method) A method definition is a triple (M; P; B) where M is a method name, P is a set of parameter specifications, ....

Francois Bancihon and Setrag Khoshafian. A calculus for complex objects. In Proc. 15th ACM Symp. on Principles of Database Systems, pages 53--59, 1986.

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