{"title":"LIVING IN A LATTICE规则语言的评价与优化","authors":"H. Riedel, A. Heuer","doi":"10.1109/ICDE.1996.492179","DOIUrl":null,"url":null,"abstract":"We introduce an evaluation technique for a declarative object-oriented database (OODB) query language. The query language is rule-based and can be evaluated and optimized using an appropriate object algebra. We introduce a new framework which uses concepts of the object-oriented data model to define adequate accesses to the database. Additionally, problems according to the evaluation of recursive queries are discussed.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"216 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Evaluation and optimization of the LIVING IN A LATTICE rule language\",\"authors\":\"H. Riedel, A. Heuer\",\"doi\":\"10.1109/ICDE.1996.492179\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce an evaluation technique for a declarative object-oriented database (OODB) query language. The query language is rule-based and can be evaluated and optimized using an appropriate object algebra. We introduce a new framework which uses concepts of the object-oriented data model to define adequate accesses to the database. Additionally, problems according to the evaluation of recursive queries are discussed.\",\"PeriodicalId\":403508,\"journal\":{\"name\":\"Proceedings of the Twelfth International Conference on Data Engineering\",\"volume\":\"216 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-02-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Twelfth International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1996.492179\",\"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 of the Twelfth International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1996.492179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evaluation and optimization of the LIVING IN A LATTICE rule language
We introduce an evaluation technique for a declarative object-oriented database (OODB) query language. The query language is rule-based and can be evaluated and optimized using an appropriate object algebra. We introduce a new framework which uses concepts of the object-oriented data model to define adequate accesses to the database. Additionally, problems according to the evaluation of recursive queries are discussed.