CAP theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "CAP theorem" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
11th place
8th place
5th place
5th place
low place
low place
1,115th place
741st place
low place
low place
670th place
480th place
69th place
59th place
18th place
17th place
low place
low place
low place
low place
6,158th place
4,128th place
580th place
462nd place
4,347th place
3,017th place
332nd place
246th place
102nd place
76th place

arxiv.org

berkeley.edu

cs.berkeley.edu

cam.ac.uk

repository.cam.ac.uk

cornell.edu

ecommons.cornell.edu

dbmsmusings.blogspot.com

doi.org

  • Gilbert, Seth; Lynch, Nancy (2002). "Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services". ACM SIGACT News. 33 (2). Association for Computing Machinery (ACM): 51–59. doi:10.1145/564585.564601. ISSN 0163-5700. S2CID 15892169.
  • Kleppmann, Martin (2015-09-18). A Critique of the CAP Theorem (Report). Apollo - University of Cambridge Repository. arXiv:1509.05393. Bibcode:2015arXiv150905393K. doi:10.17863/CAM.13083. S2CID 1991487. Retrieved 24 November 2019.
  • Brewer, Eric (2012). "CAP twelve years later: How the "rules" have changed". Computer. 45 (2). Institute of Electrical and Electronics Engineers (IEEE): 23–29. doi:10.1109/mc.2012.37. ISSN 0018-9162. S2CID 890105.
  • Armando Fox; Eric Brewer (1999). Harvest, Yield and Scalable Tolerant Systems. Proc. 7th Workshop Hot Topics in Operating Systems (HotOS 99). IEEE CS. pp. 174–178. doi:10.1109/HOTOS.1999.798396.

handle.net

hdl.handle.net

harvard.edu

ui.adsabs.harvard.edu

infoq.com

julianbrowne.com

kleppmann.com

martin.kleppmann.com

oreilly.com

  • Carpenter, Jeff; Hewitt, Eben (July 2016). Cassandra: The Definitive Guide (2nd ed.). O'Reilly Media. ISBN 9781491933657. In February 2012, Eric Brewer provided an updated perspective on his CAP theorem ... Brewer now describes the "2 out of 3" axiom as somewhat misleading. He notes that designers only need sacrifice consistency or availability in the presence of partitions, and that advances in partition recovery techniques have made it possible for designers to achieve high levels of both consistency and availability.

semanticscholar.org

api.semanticscholar.org

  • Gilbert, Seth; Lynch, Nancy (2002). "Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services". ACM SIGACT News. 33 (2). Association for Computing Machinery (ACM): 51–59. doi:10.1145/564585.564601. ISSN 0163-5700. S2CID 15892169.
  • Kleppmann, Martin (2015-09-18). A Critique of the CAP Theorem (Report). Apollo - University of Cambridge Repository. arXiv:1509.05393. Bibcode:2015arXiv150905393K. doi:10.17863/CAM.13083. S2CID 1991487. Retrieved 24 November 2019.
  • Brewer, Eric (2012). "CAP twelve years later: How the "rules" have changed". Computer. 45 (2). Institute of Electrical and Electronics Engineers (IEEE): 23–29. doi:10.1109/mc.2012.37. ISSN 0018-9162. S2CID 890105.

thislongrun.com

blog.thislongrun.com

ucsb.edu

sites.cs.ucsb.edu

worldcat.org

search.worldcat.org

  • Gilbert, Seth; Lynch, Nancy (2002). "Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services". ACM SIGACT News. 33 (2). Association for Computing Machinery (ACM): 51–59. doi:10.1145/564585.564601. ISSN 0163-5700. S2CID 15892169.
  • Brewer, Eric (2012). "CAP twelve years later: How the "rules" have changed". Computer. 45 (2). Institute of Electrical and Electronics Engineers (IEEE): 23–29. doi:10.1109/mc.2012.37. ISSN 0018-9162. S2CID 890105.