| L. Fegaras. Optimizing queries with object updates. Journal of Intelligent Information Systems, 12(2--3):219--242, 1999. |
....written as ( f g) ff gg) and ( respectively, where ] denotes union without duplicate removal and denotes list append, and f g, ff gg and [ denote the empty set, the empty bag and the empty list, respectively. 3.2. Monoid Comprehensions The monoid comprehension calculus [7, 8] is now briefly described. A comprehension over the monoid is an expression of the form fej r g, where the expression e is called the head of the comprehension and r = r 1 ; r n , n 0, is a sequence of expressions each one of which is either a qualifier of the form v e 0 or ....
....to generalize for multiple filters. R : Z ; foreach x in E : if p(x) true then R : R; U (x) return R; Figure 8. Procedural Interpretation A monoid comprehension characterizes a set of instances of the type over which it is defined. By applying the reductions given in [7] that set can be obtained. In this sense, these reductions characterize a calculus. Since, as shown below, monoid comprehensions serve as the target of a mapping from OQL expressions, the monoid comprehension calculus qualifies as a query calculus for object databases and the reductions ....
L. Fegaras. Optimizing Queries with Object Updates. JIIS, 12(23) :219--242, March-June 1999.
....this query, but it is an easy task for an optimizer to transform this algebraic form into the form shown in Figure 12.D (by pulling the outer join up in the operator tree) 8. IMPLEMENTATION We have already built a prototype ODMG database management system, called DB , based on our framework [Fegaras et al. 2000] Our system can handle most ODL declarations and can process most OQL query forms. The DB prototype is not ODMG compliant. Instead it supports its own C binding that provides a seamless integration between OQL and C with low impedance mismatch. It allows C variables to be used in ....
Fegaras, L. 1999a. Optimizing Queries with Object Updates. Journal of Intelligent Information Systems 12, 219-242. Special issue on the Functional Approach to Intelligent Information Systems.
....(known as memoization in programming languages) We are planning to investigate all these approaches more thoroughly and choose one that best 42 ts our unnesting algorithm. We are currently developing a formal framework for optimizing object oriented queries in the presence of side e ects [Feg99a] These queries may contain object updates at any place and in any form. We have proposed a language extension to the monoid comprehension calculus to express these object oriented features and we have given a formal meaning to these extensions. Our method is based on denotational semantics, ....
L. Fegaras. Optimizing Queries with Object Updates. journal of Intelligent Information Systems, 12:219{ 242, March 1999. Special issue on the Functional Approach to Intelligent Information Systems.
....and outer unnests because all these collection types are not idempotent and, therefore, it is not obvious how to extract the correct number of duplicates from the extended stream. We are currently developing a formal framework for optimizing object oriented queries in the presence of side effects [Feg98a] These queries may contain object updates at any place and in any form. We have proposed a language extension to the monoid comprehension calculus to express these object oriented features and we have given a formal meaning to these extensions. Our method is based on denotational semantics, ....
L. Fegaras. Optimizing Queries with Object Updates. Submitted to JIIS, Special Issue on Functional Approach to Intelligent Information Systems, July 1998.
No context found.
L. Fegaras. Optimizing queries with object updates. Journal of Intelligent Information Systems, 12(2--3):219--242, 1999.
No context found.
L. Fegaras. Optimizing Queries with Object Updates. JIIS, 12(23) :219--242, March-June 1999.
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