Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services Export

@article{gilbert, abstract = {When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model.}, address = {New York, NY, USA}, author = {Gilbert, Seth and Lynch, Nancy}, citeulike-article-id = {1649756}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=564601}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/564585.564601}, doi = {10.1145/564585.564601}, issn = {0163-5700}, journal = {SIGACT News}, keywords = {consistent, database}, month = {June}, number = {2}, pages = {51--59}, posted-at = {2009-06-16 13:23:48}, priority = {2}, publisher = {ACM}, title = {Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services}, url = {http://dx.doi.org/10.1145/564585.564601}, volume = {33}, year = {2002} }

TY - JOUR ID - gilbert L3 - citeulike-article-id:1649756 N2 - When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model. IS - 2 JF - SIGACT News SN - 0163-5700 AD - New York, NY, USA EP - 59 TI - Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services PB - ACM VL - 33 SP - 51 KW - consistent KW - database AU - Gilbert, Seth AU - Lynch, Nancy PY - 2002/06// UR - http://dx.doi.org/10.1145/564585.564601 ER -