D.D. Straube and M.T. Ozsu. Type Consistency of Queries in an Object-Oriented Database System. In ECOOP/OOPSLA '90 Proceedings, pages 224--233, Ottawa, Canada, October 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... languages in those systems was SQL (Structured Query Language) which eventually became an international standard for the definition and management of relationally structured data [Com86] It consists of three parts: 3 the Data Definition Language, the Data Manipulation Language and the Data Control Language. The 1990s seem to require new directions in database development to fulfill the demands of new challenging applications. However, new technologies can compete with the previous ones only if they provide tools that are comparable in power. In order to provide at least the functionality of relational ....

D.D. Straube and M.T. Ozsu. Type Consistency of Queries in an Object-Oriented Database System. In ECOOP/OOPSLA '90 Proceedings, pages 224--233, October 1990.

....be the most efficient to process; applying mgr after the Union would avoid applying it twice to objects in the intersection. The type inference mechanism of Straube and Ozsu addresses this problem by inferring the methods (such as mgr) that can apply to the result of a Union (or other operation) [144, 147]. 4.1.4 Summary These examples illustrate that knowledge about abstract data types and subtyping in the objectoriented model can affect query transformations. In order to support abstract data types an optimizer must be able to incorporate semantic query optimizations, such as those discussed ....

....query representation. Annotations are used to store information about a query and the objects it manipulates that may be useful in the optimization process. For example, annotations can be used to indicate the type of a data node. This type information could be used, for example, in type inference [147] or in semantic query optimizations [101] Annotations are a way in which more information than the query syntax can be passed between 3 In subsequent figures we only indicate Var labels for join operations, where it is necessary to distinguish between variable names assigned for two input ....

Dave D. Straube and M. Tamer Ozsu. Type Consistency of Queries in an Object-Oriented Database. In Proceedings of the Joint OOPSLA/ECOOP Conference on Object-Oriented Programming: Systems, Languages and Applications, pages 224--233. ACM, October 1990.

....towards the development of the TIGUKAT object model. The behavioral features of our model extend those of an earlier model [S O90a] making it more complete and significantly more powerful. The emphasis of the earlier work was query processing methodology in object oriented database systems [S O90b, S O91, Str91] and the object model presented in [S O90a] was restricted to include only those features which are essential for that purpose. A result of that work was the identification of necessary design requirements for an object model definition with the appropriate primitives for object ....

D.D. Straube and M.T. Ozsu. Type Consistency of Queries in an Object-Oriented Database System. In ECOOP/OOPSLA '90 Proceedings, pages 224--233, Ottawa, Canada, October 1990.

....conform to t 1 ; t n . Example 5. 4 Referring to Figure 9: MSC Gamma1 (t 1 ) j ft 1 g MSC Gamma1 (t 1 ; t 2 ) j ft 10 ; t 11 g MSC Gamma1 (t 5 ; t 7 ) j ft 11 g 3 The full set of type conformance rules that form the foundation of this type checking methodology is given in [S O90d] The rules determine the conformance of an expression from the conformance (s) of its subexpressions. A type checking algorithm is correct if it computes types that are derivable by these rules. An expression is considered type inconsistent if the rules can not be used to derive a type ....

....1 ; q k are drawn from Q 1 Theta : Theta Q k . Since the object manager interface can only apply one method per call, the method sequence must be decomposed into individual method applications. Determining which q i are a parameter for a given m j has been treated previously in [S O90d] and is not repeated here. Figure 16 depicts how the map operation Q 1 7 m 1 :m 2 :m 3 :m 4 hQ 2 ; Q 3 ; Q 4 ; Q 5 ; Q 6 ; Q 7 i is represented as a sequence of OM operations. The full algorithm to perform this transformation is given in [S O90a] and is omitted here due to space limitations. ....

D.D. Straube and M.T. Ozsu. Type consistency of queries in an object-oriented database system. In Proc. ECOOP/OOPSLA '90 Conference, pages 224--233, 1990.

....operators of an object manager. Details of the data model, full definition of calculus and algebra, including translation algorithms, and some of the rewrite rules are covered in [S O90b] The full suite of algebra rewrite rules is discussed in [S O89] The type checking rules are given in [S O90c] and the typechecking algorithm is presented in [Str91] In the case of the relational data model [Cod70] there is a close correspondence between algebra operations and the low level primitives of the physical system [SAC 79] The mapping between relations and files, and tuples and records ....

....: mn where q 1 ; q k are drawn from Q 1 Theta : Theta Q k . Since the object manager interface can only apply one method per call, the method sequence must be decomposed into individual method applications. Determining which q i are parameters for a given m j is discussed in [S O90c] and is not repeated here. Figure 5 depicts how the map operation Q 1 7 m1:m2:m3:m4 hQ 2 ; Q 3 ; Q 4 ; Q 5 ; Q 6 ; Q 7 i is represented as a sequence of OM operations. The full algorithm to perform this transformation is given in [S O90a] and is omitted here due to space limitations. ....

D.D. Straube and M.T. Ozsu. Type consistency of queries in an objectoriented database system. In Proc. ECOOP/OOPSLA '90 Conference, pages 224--233, 1990.

No context found.

D.D. Straube and M.T. Ozsu. Type Consistency of Queries in an Object-Oriented Database System. In ECOOP/OOPSLA '90 Proceedings, pages 224--233, October 1990.

....methodology and the query optimizer architecture. 2.1 Query Processing Methodology A query processing methodology similar to relational DBMSs, but modified to deal with the difficulties discussed in the previous section, can be followed in OODBMSs. Figure 1 depicts such a methodology proposed in [Straube and Ozsu 1990a] The steps of the methodology are as follows. Queries are expressed in a declarative language which requires no user knowledge of object implementations, access paths or processing strategies. The calculus expression is first calculus optimization calculus algebra transformation typecheck ....

....and consider the alternative execution algorithms as part of the search space. This methodology assumes the existence of a fully specified calculus based language and an object algebra. There are only a few calculi that have been defined for OODBMSs [Abiteboul and Beeri 1987; Peters et al. 1993; Straube and Ozsu 1990] and a few object logics with declarative query facilities [Kifer and Wu 1989; Maier 1986] There are a large number of declarative user languages (e.g. Blakeley 1991; Carey et al. 1988; Kifer et al. 1992; Orenstein et al. 1992] but these generally do not have a formal calculi. Some of these ....

[Article contains additional citation context not shown here]

STRAUBE, D., AND OZSU, M. 1990b. Type consistency of queries in an object-oriented database system. In Proc.

....Inc. 115 Flanders Road, Westboro, MA 01581, USA; e mail: daves thing.banyan.com. and query processing issues in object oriented data management systems. This paper describes the results of one part of this investigation and is an expanded and revised version of [36] Our companion papers [34, 35] discuss other related issues. We have defined a query processing methodology for an OODB (Figure 1) similar to that for relational systems (see, for example [12, 16] Queries are expressed in a declarative language which requires no user knowledge of object implementations, access paths or ....

....manipulation operators of an object manager. Details of the data model, full definition of calculus and algebra, including translation algorithms, and some of the rewrite rules are covered in [34] The full suite of algebra rewrite rules is discussed in [33] The type checking rules are given in [35] and the typechecking algorithm is presented in [32] In the case of the relational data model [7] there is a close correspondence between algebra operations and the low level primitives of the physical system [26] The mapping between relations and files, and tuples and records may have ....

[Article contains additional citation context not shown here]

D.D. Straube and M.T. Ozsu. Type consistency of queries in an object-oriented database system. In Proc. ECOOP/OOPSLA '90 Conference, pages 224--233, 1990.

No context found.

D.D. Straube and M.T. Ozsu. Type consistency of queries in an object-oriented database system. In Proc. ECOOP/OOPSLA '90 Conference, pages 224--233, 1990.

No context found.

D.D. Straube and M.T. Ozsu. Type Consistency of Queries in an ObjectOriented Database System. In ECOOP/OOPSLA '90 Proceedings, pages 224-- 233, October 1990.

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