事务性交互读取的空间复杂性

HotCDP '12 Pub Date : 2012-04-10 DOI:10.1145/2169090.2169094

Masoud Saeida Ardekani, M. Zawirski, P. Sutra, M. Shapiro

{"title":"事务性交互读取的空间复杂性","authors":"Masoud Saeida Ardekani, M. Zawirski, P. Sutra, M. Shapiro","doi":"10.1145/2169090.2169094","DOIUrl":null,"url":null,"abstract":"Transactional Web Applications need to perform fast interactive reads while ensuring reasonable isolation guarantees. This paper studies the problem of taking consistent snapshots for transactions with interactive reads. We introduce four levels of freshness, and solutions to guarantee them. We also explore trade-offs between the space complexity and the freshness levels.","PeriodicalId":183902,"journal":{"name":"HotCDP '12","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"The space complexity of transactional interactive reads\",\"authors\":\"Masoud Saeida Ardekani, M. Zawirski, P. Sutra, M. Shapiro\",\"doi\":\"10.1145/2169090.2169094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Transactional Web Applications need to perform fast interactive reads while ensuring reasonable isolation guarantees. This paper studies the problem of taking consistent snapshots for transactions with interactive reads. We introduce four levels of freshness, and solutions to guarantee them. We also explore trade-offs between the space complexity and the freshness levels.\",\"PeriodicalId\":183902,\"journal\":{\"name\":\"HotCDP '12\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"HotCDP '12\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2169090.2169094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"HotCDP '12","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2169090.2169094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

事务性Web应用程序需要执行快速交互式读取，同时确保合理的隔离保证。本文研究了具有交互读取的事务的一致性快照问题。我们介绍了四个级别的新鲜度，以及保证它们的解决方案。我们还探索了空间复杂性和新鲜度之间的权衡。

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

查看原文本刊更多论文

The space complexity of transactional interactive reads

Transactional Web Applications need to perform fast interactive reads while ensuring reasonable isolation guarantees. This paper studies the problem of taking consistent snapshots for transactions with interactive reads. We introduce four levels of freshness, and solutions to guarantee them. We also explore trade-offs between the space complexity and the freshness levels.

求助全文

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

来源期刊

HotCDP '12

自引率

0.00%

发文量