Iyini i - CAP theorem kwezesayensi yamakhompyutha?
Context:Ngokwesayensi yamakhompyutha, i-CAP theorem, ebizwa nangokuthi i-Brewer's theorem ngemuva kososayensi wekhompyutha u-Eric Brewer, ithi noma yisiphi isitolo sedatha esatshalalisiwe singanikeza iziqinisekiso ezimbili kuphela kulezi ezintathu ezilandelayo:  Ukuvumelana Ukufundwa ngakunye kuthola ukubhala kwakamuva noma iphutha. Ukutholakala Isicelo ngasinye sithola impendulo (engenaphutha), ngaphandle kwesiqinisekiso sokuthi iqukethe ukubhala kwakamuva kakhulu. Ukubekezelelana kokuhlukanisa Uhlelo luqhubeka lusebenza naphezu kwenani elizenzakalelayo lemibiko elahliwe (noma ebambezelekile) yinethiwekhi phakathi kwama-node. Lapho kwenzeka ukwehluleka kokuhlukanisa inethiwekhi, kufanele kunqunywe ukuthi kufanele kwenziwe yini okulandelayo:  ukukhansela umsebenzi futhi ngaleyo ndlela kunciphise ukutholakala kodwa kuqinisekiswe ukuvumelana ukuqhubeka nomsebenzi futhi ngaleyo ndlela kunikeze ukutholakala kodwa kube nengozi yokungahambisani.  Ngakho-ke, uma kunengxenye yenethiwekhi, umuntu kufanele akhethe phakathi kokuvumelana noma ukutholakala. Qaphela ukuthi ukungaguquguquki njengoba kuchazwe ku CAP theorem kuhluke kakhulu kunokuvumelana okuqinisekisiwe ku ACID database ukuthengiselana.  U-Eric Brewer uthi umqondo ovame ukusetshenziswa othi "amabili kwamathathu" ungadukisa ngandlela thile ngoba abaklami bezinhlelo badinga kuphela ukudela ukungaguquguquki noma ukutholakala lapho kukhona izingxenye, kodwa ukuthi ezinhlelweni eziningi izingxenye azivamile.
I-CAP theorem, ebizwa nangokuthi i-Brewer's theorem, ithi izitolo zedatha ezisatshalalisiwe zinganikeza iziqinisekiso ezimbili kuphela kwezintathu: ukungaguquguquki, ukutholakala, nokubekezelelana kokuhlukaniswa. Lapho ukwahlukanisa kwenethiwekhi kwehluleka, kufanele kunqunywe ukuthi kungakhanselwa yini ukusebenza noma kuqhutshekwe nokusebenza. U-Eric Brewer uthi umqondo othi "ababili kwabathathu" unakhohlisa.