{"title":"独立的数据库模式","authors":"M. Graham, M. Yannakakis","doi":"10.1145/588111.588144","DOIUrl":null,"url":null,"abstract":"Abstract A database schema is independent with respect to a given set of constraints if the constraints can be enforced separately in the relations. A polynomial time algorithm is presented that recognizes independent schemas, when the given constraints consist of functional dependencies and the join dependency of the database schema.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"Independent database schemas\",\"authors\":\"M. Graham, M. Yannakakis\",\"doi\":\"10.1145/588111.588144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A database schema is independent with respect to a given set of constraints if the constraints can be enforced separately in the relations. A polynomial time algorithm is presented that recognizes independent schemas, when the given constraints consist of functional dependencies and the join dependency of the database schema.\",\"PeriodicalId\":126896,\"journal\":{\"name\":\"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems\",\"volume\":\"2011 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/588111.588144\",\"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 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/588111.588144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract A database schema is independent with respect to a given set of constraints if the constraints can be enforced separately in the relations. A polynomial time algorithm is presented that recognizes independent schemas, when the given constraints consist of functional dependencies and the join dependency of the database schema.