逻辑数据库中最小不动点计算的递归与迭代方案

1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI:10.1109/ICDE.1987.7272366

G. Demo

{"title":"逻辑数据库中最小不动点计算的递归与迭代方案","authors":"G. Demo","doi":"10.1109/ICDE.1987.7272366","DOIUrl":null,"url":null,"abstract":"We study the evaluation of recursively defined virtual relations in logic databases. A contribution of our research, is to answer a query involving a recursive relation by executing either an iterative or a recursive procedure scheme depending on the variable instantiation of the query itself.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Recursive versus iterative schemes for least fix point computation in logic databases\",\"authors\":\"G. Demo\",\"doi\":\"10.1109/ICDE.1987.7272366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the evaluation of recursively defined virtual relations in logic databases. A contribution of our research, is to answer a query involving a recursive relation by executing either an iterative or a recursive procedure scheme depending on the variable instantiation of the query itself.\",\"PeriodicalId\":145433,\"journal\":{\"name\":\"1987 IEEE Third International Conference on Data Engineering\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1987 IEEE Third International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1987.7272366\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1987 IEEE Third International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1987.7272366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

研究了逻辑数据库中递归定义的虚拟关系的求值问题。我们研究的一个贡献是，根据查询本身的变量实例化，通过执行迭代或递归过程方案来回答涉及递归关系的查询。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Recursive versus iterative schemes for least fix point computation in logic databases

We study the evaluation of recursively defined virtual relations in logic databases. A contribution of our research, is to answer a query involving a recursive relation by executing either an iterative or a recursive procedure scheme depending on the variable instantiation of the query itself.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1987 IEEE Third International Conference on Data Engineering

自引率

0.00%

发文量