用规则扩展面向对象数据库

P. Soupos, S. Goutas, D. Christodoulakis
{"title":"用规则扩展面向对象数据库","authors":"P. Soupos, S. Goutas, D. Christodoulakis","doi":"10.1109/PARBSE.1990.77222","DOIUrl":null,"url":null,"abstract":"Rules have been adopted as a means of expressing knowledge which is uniform throughout the type lattice but needs to be customized for each object type with integrity constraints. More specifically, such knowledge involves associations between instances, between objects, and between objects in different databases; grouping of instances; creation and deletion of object instances; and any other activity that requires a uniform approach in order to ensure consistency and transparency. A logical query language based on the representation of associations between objects, which can be made by rules, has been used. The goal was not a full-fledged object-oriented programming language, but a logical query language with base predicate associations between objects. A logical query language has the obvious advantage of expressiveness and simplicity but poses certain difficulties in evaluation; evaluation is an issue in the case of recursive queries due to time-consuming join operations. This problem was overcome by transforming recursion into iterative navigation through associations between object instances.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Extending object-oriented databases with rules\",\"authors\":\"P. Soupos, S. Goutas, D. Christodoulakis\",\"doi\":\"10.1109/PARBSE.1990.77222\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Rules have been adopted as a means of expressing knowledge which is uniform throughout the type lattice but needs to be customized for each object type with integrity constraints. More specifically, such knowledge involves associations between instances, between objects, and between objects in different databases; grouping of instances; creation and deletion of object instances; and any other activity that requires a uniform approach in order to ensure consistency and transparency. A logical query language based on the representation of associations between objects, which can be made by rules, has been used. The goal was not a full-fledged object-oriented programming language, but a logical query language with base predicate associations between objects. A logical query language has the obvious advantage of expressiveness and simplicity but poses certain difficulties in evaluation; evaluation is an issue in the case of recursive queries due to time-consuming join operations. This problem was overcome by transforming recursion into iterative navigation through associations between object instances.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77222\",\"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. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77222","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

规则被用作表达知识的一种手段,它在整个类型格中是统一的,但需要为每个对象类型定制具有完整性约束的规则。更具体地说,这些知识涉及实例之间、对象之间以及不同数据库中对象之间的关联;实例的分组;创建和删除对象实例;以及任何其他需要统一方法以确保一致性和透明度的活动。使用了一种基于对象之间关联表示的逻辑查询语言,这种语言可以通过规则生成。目标不是一种成熟的面向对象编程语言,而是一种具有对象之间基本谓词关联的逻辑查询语言。逻辑查询语言具有明显的表达性和简单性优势,但在求值方面存在一定的困难;在递归查询的情况下,由于耗时的连接操作,求值是一个问题。通过将递归转换为通过对象实例之间的关联进行迭代导航,可以克服这个问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Extending object-oriented databases with rules
Rules have been adopted as a means of expressing knowledge which is uniform throughout the type lattice but needs to be customized for each object type with integrity constraints. More specifically, such knowledge involves associations between instances, between objects, and between objects in different databases; grouping of instances; creation and deletion of object instances; and any other activity that requires a uniform approach in order to ensure consistency and transparency. A logical query language based on the representation of associations between objects, which can be made by rules, has been used. The goal was not a full-fledged object-oriented programming language, but a logical query language with base predicate associations between objects. A logical query language has the obvious advantage of expressiveness and simplicity but poses certain difficulties in evaluation; evaluation is an issue in the case of recursive queries due to time-consuming join operations. This problem was overcome by transforming recursion into iterative navigation through associations between object instances.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信