| P. Valduriez, S. Danforth: "Query Optimization for Database Programming Languages", Proceedings of the 1st International Conference on Deductive and Object-Oriented Database Systems, pp. 516--534, 1989. |
....and objectoriented database systems was investigated and prototypes for query optimization and execution were developed [15] 21] 24] In [12] a query optimizer that was built on this prototypes for the Open OODB system is described. An extendible database programming language is described in [44]. A proposal for modelling extendible search strategies of query optimizers is found in [36] Rule based query optimization is fundamental in extendible database systems. Background on this is found in [19] 22] 24] A particularly interesting implementation was given for structural object oriented ....
....In this paper we do not discuss a specific algebra but concentrate on the means to integrate an (arbitrary) algebra into VML. What distinguishes the different variants is mainly the degree of parametrization of the operators. On the one end we have highly parametrized operators (e.g. 13][44]) together with set union and intersection. These operators typically have the following form FILTER( pred(x 1 , x n ) BOOLEAN , expr(x 1 , x n ) D , D 1 , D n ) D to which a simplified VQL query can be immediately mapped. The other extreme is, e.g. as proposed in the ....
P. Valduriez, S. Danforth: "Query Optimization for Database Programming Languages", Proceedings of the 1st International Conference on Deductive and Object-Oriented Database Systems, pp. 516--534, 1989.
....OODB implementations have not explicitly addressed the question of query optimization. Where optimization has been considered the query language usually does not allow for recursive queries and is rarely truly object oriented i.e. does not support deductive methods, overriding and late binding [20, 21, 24]. Work which has addressed recursive query optimization has concentrated on very specific concerns such as redundancy elimination or low level storage structures [10, 15] rather than general purpose optimization schemes. F logic has been proposed as a general logical foundation for fully ....
P. Valduriez and S. Danforth. Query optimization for Database Programming Languages. In DOOD, 1989.
....with control statement (e.g. Sybase s TRANSACT SQL) the major problem becomes the recognition of optimizable constructs within the input query. A promising solution is to separate the language understanding from the optimization itself which can be dedicated to several optimization experts [VALD89]. There is a necessary trade off between optimization cost and quality of the generated execution plans. Higher optimization costs are probably acceptable to produce better plans for repetitive queries, since this would reduce query execution cost and amortize the optimization cost over many ....
P. VALDURIEZ AND S. DANFORTH. "Query Optimization in Database Programming Languages," In Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases, -47Kyoto, Japan, 1989, pp. 516--534.
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