发布求助
文献互助 智能选刊 最新文献

Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems最新文献

筛选
英文 中文
The implication and finite implication problems for typed template dependencies 类型化模板依赖关系的隐含和有限隐含问题
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/588111.588149
Moshe Y. Vardi
{"title":"The implication and finite implication problems for typed template dependencies","authors":"Moshe Y. Vardi","doi":"10.1145/588111.588149","DOIUrl":"https://doi.org/10.1145/588111.588149","url":null,"abstract":"The class of typed template dependencies is a class of data dependencies that includes embedded multivalued and join dependencies. We show that the implication and the finite implication problems for this class are unsolvable. An immediate corollary is that this class has no formal system for finite implication. We also show how to construct a finite set of typed template dependencies whose implication and finite implication problems are unsolvable.The class of simple template dependencies is a proper subclass of the above class, and it generalizes slightly embedded join dependencies. It is shown that the implication and the finite implication problems for this class are also unsolvable. An immediate corollary is that this class has no formal system for either implication or finite implication.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"26 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":"128441412","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}
引用次数: 41
Compatibility and commutativity in non-two-phase locking protocols 非两阶段锁定协议中的兼容性和交换性
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/588111.588157
C. Mohan, D. Fussell, A. Silberschatz
{"title":"Compatibility and commutativity in non-two-phase locking protocols","authors":"C. Mohan, D. Fussell, A. Silberschatz","doi":"10.1145/588111.588157","DOIUrl":"https://doi.org/10.1145/588111.588157","url":null,"abstract":"Research on concurrency control mechanisms for database systems has had as a primary goal the discovery of techniques for allowing increased levels of concurrent execution of transactions. In this paper, we study this problem in the context of non-two-phase locking protocols which are defined for data bases in which a directed acyclic graph structure is superimposed on the data items. We introduce a new lock mode, called INV, with properties fundamentally different from locking modes previously studied and show how this allows increased concurrency. Through the introduction of the INV mode of locking we have enunciated a new principle of the theory of data base concurrency control. This principle involves the separation of the effects of the commutativity and compatibility of data manipulation operations. We then examine how the introduction of such a lock mode affects the occurrence of deadlocks in a system. Certain conditions under which deadlock-freedom is maintained are identified, and simple methods for removing deadlocks in other situations are presented.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"10 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":"114119191","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}
引用次数: 11
Session details: Session 3 会话详情:会话3
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/3263457
Patricia Johann
{"title":"Session details: Session 3","authors":"Patricia Johann","doi":"10.1145/3263457","DOIUrl":"https://doi.org/10.1145/3263457","url":null,"abstract":"","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"51 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":"120855788","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}
引用次数: 0
Session details: Session 9 会话详情:会话9
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/3263718
A. Pitts
{"title":"Session details: Session 9","authors":"A. Pitts","doi":"10.1145/3263718","DOIUrl":"https://doi.org/10.1145/3263718","url":null,"abstract":"","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"68 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":"124979890","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}
引用次数: 0
Concurrency on high-traffic data elements 高流量数据元素的并发性
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/588111.588126
A. Reuter
{"title":"Concurrency on high-traffic data elements","authors":"A. Reuter","doi":"10.1145/588111.588126","DOIUrl":"https://doi.org/10.1145/588111.588126","url":null,"abstract":"In many large database applications there are certain elements mostly containing aggregate information, which are very frequently referred to (read and modified) by many transactions. If access to such fields has to obey to conventional two-phase lock protocols (1,2), transactions will be serialized in front of these \"hot spots\", i.e. the degree of parallelism is reduced. To avoid this kind of lock contention some improved lock protocols have been proposed, the most interesting of which is the one implemented in IMS Fast Path (3,4), where add and subtract may be performed concurrently on numerical fields, since backout is always possible with the unique inverse of each operand. A similar scheme is proposed in (10). We expand this idea to parallel readers and writers on numerical data types, proving that under certain conditions the result of such concurrent operations is consistent in the sense that it is equal to some serial schedule (2,5).","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"9 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":"121967573","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}
引用次数: 62
Is distributed locking harder? 分布式锁更难吗?
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/588111.588129
P. Kanellakis, C. Papadimitriou
{"title":"Is distributed locking harder?","authors":"P. Kanellakis, C. Papadimitriou","doi":"10.1145/588111.588129","DOIUrl":"https://doi.org/10.1145/588111.588129","url":null,"abstract":"We examine the problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules. For a pair of transactions we prove that this concurrency control problem (which is polynomially solvable for centralized databases) is in general coNP-complete. We employ a new graph-theoretic technique and provide an efficient test for the special case of databases distributed between two sites only.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"11 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113993086","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}
引用次数: 14
Notions of dependency satisfaction 依赖性满足的概念
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/588111.588142
M. Graham, A. Mendelzon
{"title":"Notions of dependency satisfaction","authors":"M. Graham, A. Mendelzon","doi":"10.1145/588111.588142","DOIUrl":"https://doi.org/10.1145/588111.588142","url":null,"abstract":"Two notions of dependency satisfaction, consistency and completeness, are introduced. Consistency is the natural generalization of weak satisfaction and seems appropriate when only equality-generating dependencies are given, but disagrees with the standard notion in the presence of tuple-generating dependencies. Completeness is based on the intuitive semantics of tuple-generating dependencies but appears unnatural for equality-generating dependencies. It is argued that neither approach is the correct one, but rather that they correspond to different policies on constraint enforcement, and each one is appropriate in different circumstances. Consistency and completeness of a state are characterized in terms of the tableau associated with the state and in terms of logical properties of a set of first-order sentences associated with the state. A close relation between the problems of testing for consistency and completeness and of testing implication of dependencies is established. The possibility of formalizing dependency satisfaction without using a universal relation scheme is examined.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"35 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":"123194808","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}
引用次数: 0
Compatible attributes in a universal relation 通用关系中的兼容属性
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/588111.588121
C. Beeri, H. F. Korth
{"title":"Compatible attributes in a universal relation","authors":"C. Beeri, H. F. Korth","doi":"10.1145/588111.588121","DOIUrl":"https://doi.org/10.1145/588111.588121","url":null,"abstract":"The problem of entities that play multiple roles in a relational database is studied, with an emphasis on the universal relation view of the database. A tree structure is used to describe the compatibilities among attributes. The compatibility information for an attribute encodes role playing information that cannot be described by traditional data dependencies. This structure is used to define the semantics of a QUEL-like (Stonebraker et al. [1976]) query language that uses special naming rules to permit easy use of attribute compatibility","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"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":"124869619","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}
引用次数: 27
Sacrificing serializability to attain high availability of data in an unreliable network 牺牲序列化性，在不可靠的网络中获得数据的高可用性
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/588111.588124
M. Fischer, Alan Michael
{"title":"Sacrificing serializability to attain high availability of data in an unreliable network","authors":"M. Fischer, Alan Michael","doi":"10.1145/588111.588124","DOIUrl":"https://doi.org/10.1145/588111.588124","url":null,"abstract":"We present a simple algorithm for maintaining a replicated distributed dictionary which achieves high availability of data, rapid processing of atomic actions, efficient utilization of storage, and tolerance to node or network failures including lost or duplicated messages. It does not require transaction logs, synchronized clocks, or other complicated mechanisms for its operation. It achieves consistency contraints which are considerably weaker than serial consistency but nonetheless are adequate for many dictionary applications such as electronic appointment calendars and mail systems. The degree of consistency achieved depends on the particular history of operation of the system in a way that is intuitive and easily understood. The algorithm implements a \"best effort\" approximation to full serial consistency, relative to whatever internode communication has successfully taken place, so the semantics are fully specified even under partial failure of the system. Both the correctness of the algorithm and the utility of such weak semantics depend heavily on special properties of the dictionary operations.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"13 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":"126223536","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}
引用次数: 154
Session details: Session 8 会话详情:会话8
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI: 10.1145/3263717
M. Dezani
{"title":"Session details: Session 8","authors":"M. Dezani","doi":"10.1145/3263717","DOIUrl":"https://doi.org/10.1145/3263717","url":null,"abstract":"","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"10 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":"121515129","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信