| A. Rosenthal and D. S. Reiner. Querying relational views of networks. In W. Kim, D. S. Reiner, and D. S. Batory, editors, Query Processing in Database Systems, pages 109--124. Springer-Verlag, 1985. |
....and propose an algorithm for incremental view maintenance based on a lazy strategy that minimizes the number of network accesses. Relational Views over Network Databases The idea of managing relational views over hypertextual sources is similar to some proposals (see for example [42] 32] [35]) for accessing network databases through relational views: links between pages may recall set types that correlate records in the network model. However, in these works the focus is more on developing tools and methods for automatically deriving a relational view over a network database, than on ....
A. Rosenthal and D. S. Reiner. Querying relational views of networks. In W. Kim, D. S. Reiner, and D. S. Batory, editors, Query Processing in Database Systems, pages 109--124. Springer-Verlag, 1985.
.... strategies are based) Further work in relational optimization looked at extending optimization to include other operators, for example aggregators [Kim82, Day87] Optimization results have also been extended to include more expressive models, such as nested [S 89, Kor88] and network models [RR85, R 83] Object oriented databases are extensible systems which support (among other features) abstract data types, type inheritance (subtyping) methods and late binding, and object identity [MS87, BDK91, ZW86, MD90, B 87] The extensibility of object oriented databases is founded on the ....
Arnon Rosenthal and David S. Reiner. Querying relational views of networks. In Won Kim, David S. Reiner, and Don S. Batory, editors, Query Processing in Database Systems, pages 109--124. Springer-Verlag, 1985.
....and propose an algorithm for incremental view maintenance based on a lazy strategy that minimizes the number of network accesses. Relational Views over Network Databases The idea of managing relational views over hypertextual sources is similar to some proposals (see for example [32] 23] [26]) for accessing networked databases through relational views: links between pages may recall set types that correlate records in the network model. However, in these works the focus is more on developing tools and methods for automatically deriving a relational view over a network database, than ....
A. Rosenthal and D. S. Reiner. Querying relational views of networks. In W. Kim, D. S. Reiner, and D. S. Batory, editors, Query Processing in Database Systems, pages 109--124. Springer-Verlag, 1985.
....an internal NF 2 schema [17] However, an object oriented schema also incorporates notions such as subclassing and weak entities, which require additional techniques, demonstrated in this paper. There are also some similarities to the translation from SQL to CODASYL based retrieval techniques [16]. Also relevant is past work on data migration, in particular, the framework for database and application conversion described by Su et al. 19] They advocate a structural approach towards application conversion in the face of semantic database changes, which isolates queries from the application ....
A. Rosenthal & D. S. Reiner, "Querying relational views of networks," in Query Processing in Database Systems, W. Kim, D. S. Reiner & D. S. Batory, eds., Topics in Information Systems, Springer-Verlag, New York--Heidelberg--Berlin, 1985, 109--124.
.... which such strategies are based) Subsequent work in relational optimization looked at extending optimization to include other operators, for example aggregators [38, 83] Optimization results have also been extended to include more expressive models, such as nested [86, 126] and network models [118, 123]. The relational optimizers make extensive use of heuristics based on logical query transformation rules, such as commutativity of join and pushing select past join. A rule based system for optimizing relational algebra expressions was proposed by Smith and Chang [138] They use rules and ....
Arnon Rosenthal and David S. Reiner. Querying relational views of networks. In Won Kim, David S. Reiner, and Don S. Batory, editors, Query Processing in Database Systems, pages 109--124. Springer-Verlag, 1985.
....can achieve bidirectional translation between relational queries and OODB queries. 1 Introduction Heterogeneous database system techniques [2,8,11,13,14,16] can be used to allow users of one system to access data from different systems with ease. Schema transformers [3,18] and query translators [7,12] are critical components of heterogeneous database systems. Using object oriented systems as the front end system has been suggested by [4,13,16] In this paper, we consider an object oriented front end on top of relational database systems. An object oriented query will be translated to a ....
A. Rosenthal, and D. Reiner, Querying Relational Views of Networks. In Query Processing in Database Systems Edited by W. Kim, D.S. Reiner and D.S. Batory, Springer-Verlag, 1985
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