Relaxed-currency serializability for middle-tier caching and replication Export

@inproceedings{citeulike:4524782, abstract = {Many applications, such as e-commerce, routinely use copies of data that are not in sync with the database due to heuristic caching strategies used to enhance performance. We study concurrency control for a transactional model that allows update transactions to read out-of-date copies. Each read operation carries a "freshness constraint" that specifies how fresh a copy must be in order to be read. We offer a definition of correctness for this model and present algorithms to ensure several of the most interesting freshness constraints. We outline a serializability-theoretic correctness proof and present the results of a detailed performance study.}, address = {New York, NY, USA}, author = {Bernstein, Philip A. and Fekete, Alan and Guo, Hongfei and Ramakrishnan, Raghu and Tamma, Pradeep}, booktitle = {SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data}, citeulike-article-id = {4524782}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1142473.1142540}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1142473.1142540}, doi = {10.1145/1142473.1142540}, isbn = {1-59593-434-0}, keywords = {1st, 2006, consistency, relaxed-consistency, replication, sigmod, tx}, location = {Chicago, IL, USA}, pages = {599--610}, posted-at = {2009-09-23 10:43:20}, priority = {2}, publisher = {ACM}, title = {Relaxed-currency serializability for middle-tier caching and replication}, url = {http://dx.doi.org/10.1145/1142473.1142540}, year = {2006} }

TY - CONF ID - citeulike:4524782 L3 - citeulike-article-id:4524782 N2 - Many applications, such as e-commerce, routinely use copies of data that are not in sync with the database due to heuristic caching strategies used to enhance performance. We study concurrency control for a transactional model that allows update transactions to read out-of-date copies. Each read operation carries a "freshness constraint" that specifies how fresh a copy must be in order to be read. We offer a definition of correctness for this model and present algorithms to ensure several of the most interesting freshness constraints. We outline a serializability-theoretic correctness proof and present the results of a detailed performance study. CY - Chicago, IL, USA SN - 1-59593-434-0 AD - New York, NY, USA EP - 610 TI - Relaxed-currency serializability for middle-tier caching and replication PB - ACM T2 - SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data SP - 599 KW - 1st KW - 2006 KW - consistency KW - relaxed-consistency KW - replication KW - sigmod KW - tx AU - Bernstein, Philip AU - Fekete, Alan AU - Guo, Hongfei AU - Ramakrishnan, Raghu AU - Tamma, Pradeep PY - 2006/// UR - http://dx.doi.org/10.1145/1142473.1142540 ER -