{"title":"一种有效的完整性约束简化方法","authors":"Xiaolei Qian","doi":"10.1109/ICDE.1988.105477","DOIUrl":null,"url":null,"abstract":"A description is given of a very effective method for the syntax-directed simplification of multirelation, multivariable, aggregate-free integrity constraints against a fairly general class of multirelation update transactions with partial specifications. Compared with other work, the approach covers a wider range of update transactions and integrity constraints, and explores more optimization opportunities with no more effort. The method is both a uniform generalization of previous research and a basis for examining arbitrary update transactions.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"An effective method for integrity constraint simplification\",\"authors\":\"Xiaolei Qian\",\"doi\":\"10.1109/ICDE.1988.105477\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A description is given of a very effective method for the syntax-directed simplification of multirelation, multivariable, aggregate-free integrity constraints against a fairly general class of multirelation update transactions with partial specifications. Compared with other work, the approach covers a wider range of update transactions and integrity constraints, and explores more optimization opportunities with no more effort. The method is both a uniform generalization of previous research and a basis for examining arbitrary update transactions.<<ETX>>\",\"PeriodicalId\":243420,\"journal\":{\"name\":\"Proceedings. Fourth International Conference on Data Engineering\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Fourth International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1988.105477\",\"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.105477","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An effective method for integrity constraint simplification
A description is given of a very effective method for the syntax-directed simplification of multirelation, multivariable, aggregate-free integrity constraints against a fairly general class of multirelation update transactions with partial specifications. Compared with other work, the approach covers a wider range of update transactions and integrity constraints, and explores more optimization opportunities with no more effort. The method is both a uniform generalization of previous research and a basis for examining arbitrary update transactions.<>