{"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}
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.<>