{"title":"An entity-relationship algebra","authors":"C. Parent, S. Spaccapietra","doi":"10.1109/ICDE.1984.7271312","DOIUrl":null,"url":null,"abstract":"This paper defines an algebra for the manipulation of an entity-relationship data base. The algebra is said to be complete through equivalence with the usual definition of completeness for relational data manipulation languages. This work is intended to provide a sound basis for the definition of complete entity-relationship DMLs, an essential feature to make the ER model fully operational.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1984 IEEE First International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1984.7271312","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30
Abstract
This paper defines an algebra for the manipulation of an entity-relationship data base. The algebra is said to be complete through equivalence with the usual definition of completeness for relational data manipulation languages. This work is intended to provide a sound basis for the definition of complete entity-relationship DMLs, an essential feature to make the ER model fully operational.