{"title":"更细粒度的数据库缓存并发性","authors":"J. Moss, B. Leban, Panos K. Chrysanthis","doi":"10.1109/ICDE.1987.7272362","DOIUrl":null,"url":null,"abstract":"The database cache transaction recovery technique as proposed in [Elhard and Bayer 84] offers significant performance advantages for reliable database systems. However, the smallest granularity of locks it provides is the page. Here we present two schemes supporting smaller granularity. The first scheme allows maximal concurrency consistent with physical two-phase locking, with the same per-transaction I/O cost as original database cache scheme. The second scheme offers the same concurrency as the first, but features reduced I/O on commit, at the cost of some increase recovery time.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Finer grained concurrency for the database cache\",\"authors\":\"J. Moss, B. Leban, Panos K. Chrysanthis\",\"doi\":\"10.1109/ICDE.1987.7272362\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The database cache transaction recovery technique as proposed in [Elhard and Bayer 84] offers significant performance advantages for reliable database systems. However, the smallest granularity of locks it provides is the page. Here we present two schemes supporting smaller granularity. The first scheme allows maximal concurrency consistent with physical two-phase locking, with the same per-transaction I/O cost as original database cache scheme. The second scheme offers the same concurrency as the first, but features reduced I/O on commit, at the cost of some increase recovery time.\",\"PeriodicalId\":145433,\"journal\":{\"name\":\"1987 IEEE Third International Conference on Data Engineering\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1987 IEEE Third International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1987.7272362\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1987 IEEE Third International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1987.7272362","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
摘要
[Elhard and Bayer 84]中提出的数据库缓存事务恢复技术为可靠的数据库系统提供了显著的性能优势。但是，它提供的锁的最小粒度是页。这里我们提出了两种支持更小粒度的方案。第一种方案允许与物理两阶段锁定一致的最大并发性，每个事务的I/O成本与原始数据库缓存方案相同。第二种方案提供了与第一种相同的并发性，但在提交时减少了I/O，代价是增加了恢复时间。
The database cache transaction recovery technique as proposed in [Elhard and Bayer 84] offers significant performance advantages for reliable database systems. However, the smallest granularity of locks it provides is the page. Here we present two schemes supporting smaller granularity. The first scheme allows maximal concurrency consistent with physical two-phase locking, with the same per-transaction I/O cost as original database cache scheme. The second scheme offers the same concurrency as the first, but features reduced I/O on commit, at the cost of some increase recovery time.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
