This report proposes a Reference Model (RM) for database management system (DBMS) standardization. A Reference Model is a conceptual framework whose purpose is to divide standardization work into manageable pieces and to show at a general level how these pieces are related with each other. The proposed RM comprises a Data Mapping Control System (DMCS) that retrieves and stores application data, application schemas, and data dictionary schemas. This DMCS is bounded by two interfaces: the Data Language (DL) interface which defines the services offered by the DMCS to various Data Management Tools (DMT), and the internal Data Language (i-DL) interface which defines the services required by the DMCS from the host operating system. This report suggests two candidates for standardization: the DL and the i-DL.
本文提出了一个数据库管理系统(DBMS)标准化的参考模型。参考模型是一个概念性框架，其目的是将标准化工作划分为可管理的部分，并在一般级别上显示这些部分是如何相互关联的。提议的RM包括一个数据映射控制系统(Data Mapping Control System, DMCS)，用于检索和存储应用程序数据、应用程序模式和数据字典模式。这个DMCS由两个接口限制:数据语言(DL)接口，它定义DMCS向各种数据管理工具(DMT)提供的服务;内部数据语言(i-DL)接口，它定义DMCS从主机操作系统所需的服务。该报告提出了两种标准化候选:DL和i-DL。
{"title":"Reference model for DBMS standardization","authors":"E. Fong, D. Jefferson, C. Reedy, W. Truszkowski","doi":"10.1145/16342.16343","DOIUrl":"https://doi.org/10.1145/16342.16343","url":null,"abstract":"This report proposes a Reference Model (RM) for database management system (DBMS) standardization. A Reference Model is a conceptual framework whose purpose is to divide standardization work into manageable pieces and to show at a general level how these pieces are related with each other. The proposed RM comprises a Data Mapping Control System (DMCS) that retrieves and stores application data, application schemas, and data dictionary schemas. This DMCS is bounded by two interfaces: the Data Language (DL) interface which defines the services offered by the DMCS to various Data Management Tools (DMT), and the internal Data Language (i-DL) interface which defines the services required by the DMCS from the host operating system. This report suggests two candidates for standardization: the DL and the i-DL.","PeriodicalId":49524,"journal":{"name":"Sigmod Record","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/16342.16343","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64105300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reliability in distributed database systems (panel discussion)","authors":"BhargavaBharat","doi":"10.1145/971699.318992","DOIUrl":"https://doi.org/10.1145/971699.318992","url":null,"abstract":"","PeriodicalId":49524,"journal":{"name":"Sigmod Record","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/971699.318992","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64181470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Relational algebras as developed by Codd and his followers are extended by noting an equivalence with functional languages. This leads to higher order relations, recursive definitions of relations,...
{"title":"Relational algebras, logic, and functional programming","authors":"A. V. HallPatrick","doi":"10.1145/971697.602301","DOIUrl":"https://doi.org/10.1145/971697.602301","url":null,"abstract":"Relational algebras as developed by Codd and his followers are extended by noting an equivalence with functional languages. This leads to higher order relations, recursive definitions of relations,...","PeriodicalId":49524,"journal":{"name":"Sigmod Record","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/971697.602301","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64181159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A new method for multikey access suitable for dynamic files is proposed that transforms multiple key values into a logical address This method is based on a new structure, called predicate tree, th...
提出了一种适用于动态文件的多键访问新方法，该方法将多个键值转换为一个逻辑地址。
{"title":"A multikey hashing scheme using predicate trees","authors":"ValduriezPatrick, ViemontYann","doi":"10.1145/971697.602275","DOIUrl":"https://doi.org/10.1145/971697.602275","url":null,"abstract":"A new method for multikey access suitable for dynamic files is proposed that transforms multiple key values into a logical address This method is based on a new structure, called predicate tree, th...","PeriodicalId":49524,"journal":{"name":"Sigmod Record","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/971697.602275","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64181142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We develop a theory of relations that are constructed by the union and selection operations from fragment relations. Algorithms for inserting and deleting from relations that are composed of physic...
我们发展了一个由片段关系的联合和选择操作构造的关系理论。对物理关系进行插入和删除的算法。
{"title":"Fragments of relations","authors":"MaierDavid, D. UllmanJeffrey","doi":"10.1145/971695.582200","DOIUrl":"https://doi.org/10.1145/971695.582200","url":null,"abstract":"We develop a theory of relations that are constructed by the union and selection operations from fragment relations. Algorithms for inserting and deleting from relations that are composed of physic...","PeriodicalId":49524,"journal":{"name":"Sigmod Record","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"1983-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/971695.582200","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64181102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Panel on dbms and ai: is there any common point of view?","authors":"M. Stonebraker","doi":"10.1145/3262590","DOIUrl":"https://doi.org/10.1145/3262590","url":null,"abstract":"","PeriodicalId":49524,"journal":{"name":"Sigmod Record","volume":"32 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"1983-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64011275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：