Ashish Mehta, J. Geller, Y. Perl, and P. Fankhauser. Computing access relevance to support path-method generation in interoperable Multi-OODB. In RIDE-93 (Research Issues in Data Engineering), pages 144--151, Vienna, Austria, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....concepts that allow a user to view them in some integrated way. It of course remains to be seen if a language that is sophisticated enough to meet al..l of the requirements given by Kent in his solution can be developed in the near future. A very recent approach to interoperability by Mehta et al. [18] uses so called path methods to explicitly create inter component and inter object mappings between source and target object classes in order to retrieve and update related data objects. The obvious drawback of this approach is the large overhead in calculating and maintaining the mappings, which ....

A. Mehta, J. Geller, Y. Perl, and P. Fankhauser. Computing Access Relevance to Support PathMethod Generation in Interoperable MultiOODB. In Proceedings of the International Conference on Very Large Databases, pages 119--139. IEEE, August 1992.

....common concepts that allow a user to view them in some integrated way. It remains to be seen if a language that is sophisticated enough to meet al..l of the requirements given by Kent in his solution can be developed in the near future. A very recent approach to interoperability by Mehta et al. [38] uses so called path methods to access distant information in a federation of database components. Instead of integrating foreign objects into the intended target schema (as we propose in this research) explicit inter component and inter object mappings are created between the source and the ....

A. Mehta, J. Geller, Y. Perl, and P. Fankhauser. Computing Access Relevance to Support Path-Method Generation in Interoperable Multi-OODB. In Proceedings of the International Conference on Very Large Databases, pages 119--139. IEEE, August 1992.

....among different similar concepts that allow a user to view them in some integrated way. It of course remains to be seen if a language that is sophisticated enough to meet al..l of the requirements given can be developed in the near future. A very recent approach to interoperability by Mehta et al. [18] uses so called pathmethods to explicitly create inter component and inter object mappings between source and target object classes in order to retrieve and update related data objects. The obvious drawback of this approach is the large overhead in calculating and maintaining the mappings, which ....

A. Mehta, J. Geller, Y. Perl, and P. Fankhauser. Computing Access Relevance to Support Path-Method Generation in Interoperable Multi-OODB. In Proceedings of the International Conference on Very Large Databases, pages 119--139. IEEE, August 1992.

....number of relationships than from the number of classes. We define the complexity, c, of a schema as the ratio of the number of the relationships between classes, and the number of classes. For two schemas of equal size, a more complex schema is more difficult to comprehend. In our previous work [8, 9, 10] we used a large OODB schema describing a university. In this paper, we will demonstrate our techniques on a schema from the university environment, as most readers have better knowledge about professors and chairpersons, than about medical terms such as nucleotide sequences and antibiotic ....

Ashish Mehta, J. Geller, Y. Perl, and P. Fankhauser. Computing access relevance to support path-method generation in interoperable Multi-OODB. In RIDE-93 (Research Issues in Data Engineering), pages 144--151, Vienna, Austria, 1993.

....offer from the PMG. The PMG is based on access weights attached to the connections between classes and precomputed access relevance between every pair of classes of the OODB. Specific rules for access weight assignment and algorithms for computing access relevance appeared in our previous papers [MGPF92, MGPF93, MGPF96]. In this paper we present a variety of traversal algorithms based on access weights and precomputed access relevance. Experiments identify some of these algorithms as very successful in generating most desired path methods. The PMG system utilizes these successful algorithms and is thus an ....

....is part of the OOHVR (Object Oriented Healthcare Vocabulary Repository) project, supported by the NIST ATP program through the HOST consortium. 1. 2 Basic Approach to Path Method Generation In this paper we discuss path method generation using access weights and precomputed access relevance [MGPF92, MGPF93, MGPF96]. Every schema is modeled as a graph of nodes and edges. Nodes model classes, edges model connections between classes. Access weights are numbers assigned to these edges. Access relevances are calculated from these access weights. Access relevances are defined for pairs of classes whether they are ....

[Article contains additional citation context not shown here]

Mehta, A., Geller, J., Perl, Y., Fankhauser, P., Computing Access Relevance to support PathMethod Generation in Interoperable Multi-OODB, Proceedings of the RIDE-IMS'93: Third International Workshop on Research Issues on Data Engineering: Interoperability in Multidatabase Systems, Vienna, Austria, April 18--20, 1993, pp. 144--151.

....offer from the PMG. The PMG is based on access weights attached to the connections between classes and precomputed access relevance between every pair of classes of the OODB. Specific rules for access weight assignment and algorithms for computing access relevance appeared in our previous papers [MGPF92, MGPF93, MGPF96]. In this paper, we present a variety of traversal algorithms based on access weights and precomputed access relevance. Experiments identify some of these algorithms as very successful in generating most desired path methods. The PMG system utilizes these successful algorithms and is thus an ....

....is part of the OOHVR (Object Oriented Healthcare Vocabulary Repository) project, supported by the NIST ATP program through the HOST consortium. 1. 2 Basic approach to path method generation In this paper, we discuss path method generation using access weights and precomputed access relevance [MGPF92, MGPF93, MGPF96]. Every schema is modeled as a graph of nodes and edges. Nodes model classes, edges model connections between classes. Access weights are numbers assigned to these edges. Access relevances are calculated from these access weights. Access relevances are defined for pairs of classes, whether they ....

[Article contains additional citation context not shown here]

Mehta A, Geller J, Perl Y, Fankhauser P (1993) Computing Access Relevance to support Path-Method Generation in Interoperable Multi-OODB. Proceedings of the RIDEIMS '93: Third International Workshop on Research Issues on Data Engineering: Interoperability in Multidatabase Systems, Vienna, Austria, pp 144--151

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