{"title":"将选择项移动到线性最小不动点查询中","authors":"R. Agrawal, Premkumar T. Devanbu","doi":"10.1109/ICDE.1988.105491","DOIUrl":null,"url":null,"abstract":"A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form 'column theta value' to be evaluated ahead of the least fixpoint operator while processing linear recursive queries. It is shown that the algorithm transposes the strongest possible selection.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Moving selections into linear least fixpoint queries\",\"authors\":\"R. Agrawal, Premkumar T. Devanbu\",\"doi\":\"10.1109/ICDE.1988.105491\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form 'column theta value' to be evaluated ahead of the least fixpoint operator while processing linear recursive queries. It is shown that the algorithm transposes the strongest possible selection.<<ETX>>\",\"PeriodicalId\":243420,\"journal\":{\"name\":\"Proceedings. Fourth International Conference on Data Engineering\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Fourth International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1988.105491\",\"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. Fourth International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1988.105491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Moving selections into linear least fixpoint queries
A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form 'column theta value' to be evaluated ahead of the least fixpoint operator while processing linear recursive queries. It is shown that the algorithm transposes the strongest possible selection.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
