Several methods are studied for dynamically creating a dump copy of a database while the database is on-line and being updated by user transactions. The methods can be characterized by whether the dump represents the database that existed at the beginning of the dump creation, at the end, or sometime in the middle. The methods are analyzed to understand the performance tradeoffs between alternate methods. The methods vary in the time required to create the dump and the amount of extra storage needed. A key parameter of a given system is shown to be the ratio of the rate at which database entities are copied into the dump to the rate at which database entities are updated. For certain methods to work, the ratio must exceed one. However, by combining two methods into a hybrid scheme, the ratio need only exceed one half.
{"title":"Dynamic database dumping","authors":"D. Rosenkrantz","doi":"10.1145/509252.509257","DOIUrl":"https://doi.org/10.1145/509252.509257","url":null,"abstract":"Several methods are studied for dynamically creating a dump copy of a database while the database is on-line and being updated by user transactions. The methods can be characterized by whether the dump represents the database that existed at the beginning of the dump creation, at the end, or sometime in the middle. The methods are analyzed to understand the performance tradeoffs between alternate methods. The methods vary in the time required to create the dump and the amount of extra storage needed. A key parameter of a given system is shown to be the ratio of the rate at which database entities are copied into the dump to the rate at which database entities are updated. For certain methods to work, the ratio must exceed one. However, by combining two methods into a hybrid scheme, the ratio need only exceed one half.","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116983138","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}
Sumiyasu Yamamoto, Shinsei Tazawa, K. Ushio, H. Ikeda
A file organization scheme in an information storage and retrieval system which will be called a generalized Hiroshima University balanced multiple-valued file organization scheme of order two (GHUBMFS2) is presented, where the information about the records is indexed by m attributes having n values. The number of buckets to be organized and the redundancy of the file are the same as those of an inverted file. The number of pointer fields to be attached to the accession number stored in a bucket is reduced to a minimum in this scheme. It can answer for all second order as well as first order queries by the access to one bucket and the traversal of its contents without any set operations.
{"title":"Design of a generalized balanced multiple-valued file organization scheme of order two","authors":"Sumiyasu Yamamoto, Shinsei Tazawa, K. Ushio, H. Ikeda","doi":"10.1145/509252.509271","DOIUrl":"https://doi.org/10.1145/509252.509271","url":null,"abstract":"A file organization scheme in an information storage and retrieval system which will be called a generalized Hiroshima University balanced multiple-valued file organization scheme of order two (GHUBMFS2) is presented, where the information about the records is indexed by m attributes having n values. The number of buckets to be organized and the redundancy of the file are the same as those of an inverted file. The number of pointer fields to be attached to the accession number stored in a bucket is reduced to a minimum in this scheme. It can answer for all second order as well as first order queries by the access to one bucket and the traversal of its contents without any set operations.","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122705865","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 use of "rules of inference" in database systems with access paths--e.g., CODASYL and IMS databases--is proposed to allow nonprocedural querying of the database systems. The kinds of access paths for which these rules of inference are required are isolated. It is shown that the rules of inference required for a CODASYL or an IMS database depend on the configurations of the edges in a diagram of the database.
{"title":"Nonprocedural query processing for databases with access paths","authors":"N. Griffeth","doi":"10.1145/509252.509291","DOIUrl":"https://doi.org/10.1145/509252.509291","url":null,"abstract":"The use of \"rules of inference\" in database systems with access paths--e.g., CODASYL and IMS databases--is proposed to allow nonprocedural querying of the database systems. The kinds of access paths for which these rules of inference are required are isolated. It is shown that the rules of inference required for a CODASYL or an IMS database depend on the configurations of the edges in a diagram of the database.","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128531327","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: concurrency and recovery","authors":"","doi":"10.1145/3250385","DOIUrl":"https://doi.org/10.1145/3250385","url":null,"abstract":"","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130356772","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: Panel: database machines","authors":"","doi":"10.1145/3250395","DOIUrl":"https://doi.org/10.1145/3250395","url":null,"abstract":"","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134034842","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":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","authors":"E. Lowenthal, N. Dale","doi":"10.1145/509252","DOIUrl":"https://doi.org/10.1145/509252","url":null,"abstract":"","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134532403","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}
Supporting multiple user views of databases is currently an important problem area in database management system development. An interesting facet of this problem arises whenever a user needs an integrated view of several distinct databases. Using traditional database concepts, an aggregate schema facility has been developed to address this problem. The basic functions of an aggregate schema facility are discussed, as well as their implementation in a CODASYL/DBTG-like environment. Interest in an aggregate schema facility grew out of a problem in restructuring large databases. The application of this facility to restructuring is discussed, as well as potential applications to dynamic translation and distributed databases.
{"title":"Towards the support of integrated views of multiple databases: an aggregate schema facility","authors":"Donald E. Swartwout, J. Fry","doi":"10.1145/509252.509285","DOIUrl":"https://doi.org/10.1145/509252.509285","url":null,"abstract":"Supporting multiple user views of databases is currently an important problem area in database management system development. An interesting facet of this problem arises whenever a user needs an integrated view of several distinct databases. Using traditional database concepts, an aggregate schema facility has been developed to address this problem. The basic functions of an aggregate schema facility are discussed, as well as their implementation in a CODASYL/DBTG-like environment. Interest in an aggregate schema facility grew out of a problem in restructuring large databases. The application of this facility to restructuring is discussed, as well as potential applications to dynamic translation and distributed databases.","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131556550","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}
A dynamic address computation mechanism for use in database management is presented. The address computation technique allows information structured according to a given pre-defined tree to be stored without any address pointers, yet the populated tree is assumed to have an arbitrary number of branches below non-terminating tree nodes, and have arbitrary length information stored at the tree leaves. The address computation is accomplished using a compact (yet complete) address-free description of the populated tree structure. Utilization of this description allows information at any level of the tree to be directly accessed. The address computation provides the basis for an "intermediate" database architecture which embodies many of the advantages of both associative architectures and classical Von Neumann architectures.
{"title":"A dynamic address computation mechanism for use in database management","authors":"T. Cook","doi":"10.1145/509252.509274","DOIUrl":"https://doi.org/10.1145/509252.509274","url":null,"abstract":"A dynamic address computation mechanism for use in database management is presented. The address computation technique allows information structured according to a given pre-defined tree to be stored without any address pointers, yet the populated tree is assumed to have an arbitrary number of branches below non-terminating tree nodes, and have arbitrary length information stored at the tree leaves. The address computation is accomplished using a compact (yet complete) address-free description of the populated tree structure. Utilization of this description allows information at any level of the tree to be directly accessed. The address computation provides the basis for an \"intermediate\" database architecture which embodies many of the advantages of both associative architectures and classical Von Neumann architectures.","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131644001","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: Panel: the conceptual schema controversy","authors":"","doi":"10.1145/3250391","DOIUrl":"https://doi.org/10.1145/3250391","url":null,"abstract":"","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127566566","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: formal topics","authors":"","doi":"10.1145/3250389","DOIUrl":"https://doi.org/10.1145/3250389","url":null,"abstract":"","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129863641","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
扫码关注我们
求助内容：
应助结果提醒方式：