计算访问相关性,支持可互操作的多面向对象数据库中的路径方法生成

Ashish Mehta, J. Geller, Y. Perl, Péter Fankhauser
{"title":"计算访问相关性,支持可互操作的多面向对象数据库中的路径方法生成","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":"{\"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}","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

摘要

要从可互操作的多面向对象数据库(IM-OODB)访问远程信息,用户需要通过一个或多个OODB模式构造检索路径方法。路径方法生成器(PMG)系统支持为单个OODB生成这样的路径方法,使用预先计算的类对之间的访问相关性。存在有效的算法来计算自治OODB中的访问相关性。作者使用了一种新的方法来推导IM-OODB中访问相关性计算的有效在线算法,该算法将用于生成IM-OODB中不同oodb类之间的路径方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Computing access relevance to support path-method generation in interoperable multi-OODB
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.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信