{"title":"数据库理论和圆柱格","authors":"S. Cosmadakis","doi":"10.1109/SFCS.1987.17","DOIUrl":null,"url":null,"abstract":"The relational model for databases [Co I, Co2] provides a valuable formal foundation for understanding the issues of database design. A relational database consists of a set of tables (relations), where each table contains a set of records (tuples). For example, we might have a database with two relations Rand S, where R has two columns labeled EMP (employee) and SAL (salary), and S has two columns labeled PRJ (project) and MGR (manager).","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Database theory and cylindric lattices\",\"authors\":\"S. Cosmadakis\",\"doi\":\"10.1109/SFCS.1987.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The relational model for databases [Co I, Co2] provides a valuable formal foundation for understanding the issues of database design. A relational database consists of a set of tables (relations), where each table contains a set of records (tuples). For example, we might have a database with two relations Rand S, where R has two columns labeled EMP (employee) and SAL (salary), and S has two columns labeled PRJ (project) and MGR (manager).\",\"PeriodicalId\":153779,\"journal\":{\"name\":\"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1987.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1987.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The relational model for databases [Co I, Co2] provides a valuable formal foundation for understanding the issues of database design. A relational database consists of a set of tables (relations), where each table contains a set of records (tuples). For example, we might have a database with two relations Rand S, where R has two columns labeled EMP (employee) and SAL (salary), and S has two columns labeled PRJ (project) and MGR (manager).