分布式锁更难吗?

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":"分布式锁更难吗?","authors":"P. Kanellakis, C. Papadimitriou","doi":"10.1145/588111.588129","DOIUrl":null,"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.0000,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Is distributed locking harder?\",\"authors\":\"P. Kanellakis, C. Papadimitriou\",\"doi\":\"10.1145/588111.588129\",\"DOIUrl\":null,\"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.0000,\"publicationDate\":\"1982-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/588111.588129\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/588111.588129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

摘要

我们研究了一个问题，即确定访问分布式数据库的一组锁定事务是否保证只产生可序列化的调度。对于一对事务，我们证明了该并发控制问题(对于集中式数据库是多项式可解的)一般是conp完全的。我们采用了一种新的图论技术，并为数据库仅分布在两个站点之间的特殊情况提供了一种有效的测试。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Is distributed locking harder?

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems

自引率

0.00%

发文量