A new theory of data representation involving "formats", which are based on three recurrent and prominent data-structuring concepts, is introduced. In a mathematically rigorous way, a notion of "equivalent" information capacity is defined and shown to be natural in a wide range of contexts. A normal form is introduced, and each equivalence class of formats is shown to have a unique representative in normal form. Finally, a natural way of comparing the information capacity of (non-equivalent) formats is formalized and studied.
{"title":"The format model: a theory of database organization","authors":"R. Hull, C. Yap","doi":"10.1145/588111.588146","DOIUrl":"https://doi.org/10.1145/588111.588146","url":null,"abstract":"A new theory of data representation involving \"formats\", which are based on three recurrent and prominent data-structuring concepts, is introduced. In a mathematically rigorous way, a notion of \"equivalent\" information capacity is defined and shown to be natural in a wide range of contexts. A normal form is introduced, and each equivalence class of formats is shown to have a unique representative in normal form. Finally, a natural way of comparing the information capacity of (non-equivalent) formats is formalized and studied.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125259370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Many concurrency control algorithms for distributed database management systems have been proposed in the last few years, but little has been done to analyse their performance. This paper presents the specification of a concurrency control algorithm based on the two-phase commit protocol for DDBs. The results of a complete performance analysis based on an analytic model are presented and discussed.
{"title":"Performance evaluation of a two-phase commit based protocol for DDBs","authors":"D. Menascé, Tatuo Nakanishi","doi":"10.1145/588111.588152","DOIUrl":"https://doi.org/10.1145/588111.588152","url":null,"abstract":"Many concurrency control algorithms for distributed database management systems have been proposed in the last few years, but little has been done to analyse their performance. This paper presents the specification of a concurrency control algorithm based on the two-phase commit protocol for DDBs. The results of a complete performance analysis based on an analytic model are presented and discussed.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122832855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Various notions are introduced for the closure of a set of rectilinearly oriented rectangles on the plane. Optimal algorithms are presented for computing the closures. These algorithms imply optimal solutions to several problems related to database concurrency control.
{"title":"An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems","authors":"E. Soisalon-Soininen, D. Wood","doi":"10.1145/588111.588130","DOIUrl":"https://doi.org/10.1145/588111.588130","url":null,"abstract":"Various notions are introduced for the closure of a set of rectilinearly oriented rectangles on the plane. Optimal algorithms are presented for computing the closures. These algorithms imply optimal solutions to several problems related to database concurrency control.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122050856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Concurrency control in a dynamic search structure","authors":"U. Manber, R. Ladner","doi":"10.1145/588111.588156","DOIUrl":"https://doi.org/10.1145/588111.588156","url":null,"abstract":"","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129921535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The papers in this volume were presented at the ACM Symposium on Database Systems at the Marina del Rey Hotel in Los Angeles, California, March 29-31, 1982, sponsored jointly by the ACM Special Interest Group for Automata and Computability Theory and by the ACM Special Interest Group for the Management of Data.The articles in this proceedings were selected on November 24, 1981 at a meeting of the program committee from 104 abstracts submitted to the call for papers. The articles generally represent preliminary reports of ongoing research and it is anticipated that many of these articles will appear in more polished form in scientific journals.
本卷中的论文于1982年3月29日至31日在加利福尼亚州洛杉矶的Marina del Rey酒店举行的ACM数据库系统研讨会上发表，该研讨会由ACM自动机和可计算理论特别兴趣小组和ACM数据管理特别兴趣小组联合主办。本论文集中的文章是1981年11月24日在计划委员会的一次会议上从104份提交给论文征集的摘要中选出的。这些文章通常代表了正在进行的研究的初步报告，预计其中许多文章将以更完善的形式出现在科学期刊上。
{"title":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","authors":"J. Ullman, A. Aho","doi":"10.1145/588111","DOIUrl":"https://doi.org/10.1145/588111","url":null,"abstract":"The papers in this volume were presented at the ACM Symposium on Database Systems at the Marina del Rey Hotel in Los Angeles, California, March 29-31, 1982, sponsored jointly by the ACM Special Interest Group for Automata and Computability Theory and by the ACM Special Interest Group for the Management of Data.The articles in this proceedings were selected on November 24, 1981 at a meeting of the program committee from 104 abstracts submitted to the call for papers. The articles generally represent preliminary reports of ongoing research and it is anticipated that many of these articles will appear in more polished form in scientific journals.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123910595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Session 5","authors":"R. Cytron","doi":"10.1145/3263470","DOIUrl":"https://doi.org/10.1145/3263470","url":null,"abstract":"","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"87 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132218932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The following problem is studied: How, and to what extent, can the retrieval speed of external hashing be improved by storing a small amount of extra information in internal storage? Several algorithms that guarantee retrieval in one access are developed and analyzed. In the first part of the paper, a restricted class of algorithms is studied, and a lower bound on the amount of extra storage is derived. An algorithm that achieves this bound, up to a constant difference, is also given. In the second part of the paper a number of restrictions are relaxed and several more practical algorithms are developed and analyzed. The last one, in particular, is very simple and efficient, allowing retrieval in one access using only a fixed number of bits of extra internal storage per bucket. The amount of extra internal storage depends on several factors, but it is typically very small: only a fraction of a bit per record stored. The cost of inserting a record is also analyzed and found to be low. Taking all factors into account, this algorithm is highly competitive for applications requiring very fast retrieval.
{"title":"External hasing with limited internal storage","authors":"G. Gonnet, P. Larson","doi":"10.1145/588111.588153","DOIUrl":"https://doi.org/10.1145/588111.588153","url":null,"abstract":"The following problem is studied: How, and to what extent, can the retrieval speed of external hashing be improved by storing a small amount of extra information in internal storage? Several algorithms that guarantee retrieval in one access are developed and analyzed. In the first part of the paper, a restricted class of algorithms is studied, and a lower bound on the amount of extra storage is derived. An algorithm that achieves this bound, up to a constant difference, is also given. In the second part of the paper a number of restrictions are relaxed and several more practical algorithms are developed and analyzed. The last one, in particular, is very simple and efficient, allowing retrieval in one access using only a fixed number of bits of extra internal storage per bucket. The amount of extra internal storage depends on several factors, but it is typically very small: only a fraction of a bit per record stored. The cost of inserting a record is also analyzed and found to be low. Taking all factors into account, this algorithm is highly competitive for applications requiring very fast retrieval.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131596071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using write-once memory for database storage","authors":"D. Maier","doi":"10.1145/588111.588151","DOIUrl":"https://doi.org/10.1145/588111.588151","url":null,"abstract":"","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"19 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133719583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Session 7","authors":"Yizhou Sun","doi":"10.1145/3262685","DOIUrl":"https://doi.org/10.1145/3262685","url":null,"abstract":"","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128404887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Usually, the first normal form condition of the relational model of data is imposed. Presently, a broader class of data base applications like office information systems is considered where this restriction is not convenient. Therefore, an extension of the relational model is proposed consisting of Non First Normal Form (NF2) relations. The relational algebra is enriched mainly by so called nest and unnest operations which transform between NF2 relations and the usual ones. We state some properties of these operations and some rules which occur in combination with the operations of the usual relational algebra. Since we propose to use the NF2 model also for the internal data model these rules are important not only for theoretical reasons but also for a practical implementation.
{"title":"Remarks on the algebra of non first normal form relations","authors":"G. Jaeschke, H. Schek","doi":"10.1145/588111.588133","DOIUrl":"https://doi.org/10.1145/588111.588133","url":null,"abstract":"Usually, the first normal form condition of the relational model of data is imposed. Presently, a broader class of data base applications like office information systems is considered where this restriction is not convenient. Therefore, an extension of the relational model is proposed consisting of Non First Normal Form (NF2) relations. The relational algebra is enriched mainly by so called nest and unnest operations which transform between NF2 relations and the usual ones. We state some properties of these operations and some rules which occur in combination with the operations of the usual relational algebra. Since we propose to use the NF2 model also for the internal data model these rules are important not only for theoretical reasons but also for a practical implementation.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129595706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：