Ashish Mehta, J. Geller, Y. Perl, Péter Fankhauser
{"title":"Computing access relevance to support path-method generation in interoperable multi-OODB","authors":"Ashish Mehta, J. Geller, Y. Perl, Péter Fankhauser","doi":"10.1109/RIDE.1993.281931","DOIUrl":null,"url":null,"abstract":"To access distant information from an interoperable multi object-oriented database (IM-OODB), a user needs to construct retrieval path-methods through one or several OODB schemas. The path-method generator (PMG) system supports the generation of such path-methods for a single OODB, using precomputed access relevance between pairs of classes. Efficient algorithms to compute access relevance in an autonomous OODB exist. The authors use a novel approach for deriving efficient online algorithms for the computation of access relevance in an IM-OODB, which will be used in generating path-methods between classes of different OODBs in an IM-OODB.<<ETX>>","PeriodicalId":302564,"journal":{"name":"Proceedings RIDE-IMS `93: Third International Workshop on Research Issues in Data Engineering: Interoperability in Multidatabase Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings RIDE-IMS `93: Third International Workshop on Research Issues in Data Engineering: Interoperability in Multidatabase Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.1993.281931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
To access distant information from an interoperable multi object-oriented database (IM-OODB), a user needs to construct retrieval path-methods through one or several OODB schemas. The path-method generator (PMG) system supports the generation of such path-methods for a single OODB, using precomputed access relevance between pairs of classes. Efficient algorithms to compute access relevance in an autonomous OODB exist. The authors use a novel approach for deriving efficient online algorithms for the computation of access relevance in an IM-OODB, which will be used in generating path-methods between classes of different OODBs in an IM-OODB.<>