. ▁Cla re ' s , ▁Oxford ▁Category : B oc con i ▁University ▁al umn i ▁Category : Ital ian ▁football ▁chair men ▁and ▁invest ors ▁Category : J u vent us ▁F . C . ▁chair men ▁and ▁invest ors ▁Category : A gn elli ▁family ▁Category : B our bon ▁del ▁Monte ▁family ▁Category : F iat ▁people ▁Category : J u vent us ▁F . C . ▁direct ors <0x0A> </s> ▁In ▁theoretical ▁computer ▁science , ▁the ▁P AC EL C ▁theorem ▁is ▁an ▁extension ▁to ▁the ▁C AP ▁theorem . ▁It ▁states ▁that ▁in ▁case ▁of ▁network ▁partition ing ▁( P ) ▁in ▁a ▁distributed ▁computer ▁system , ▁one ▁has ▁to ▁choose ▁between ▁avail ability ▁( A ) ▁and ▁consist ency ▁( C ) ▁( as ▁per ▁the ▁C AP ▁theorem ), ▁but ▁else ▁( E ), ▁even ▁when ▁the ▁system ▁is ▁running ▁normally ▁in ▁the ▁absence ▁of ▁partitions , ▁one ▁has ▁to ▁choose ▁between ▁laten cy ▁( L ) ▁and ▁consist ency ▁( C ). ▁ ▁Over view ▁▁ ▁P AC EL C ▁builds ▁on ▁the ▁C AP ▁theorem . ▁Both ▁the or ems ▁describe ▁how ▁distributed ▁databases ▁have ▁limitations ▁and ▁trade offs ▁regarding ▁consist ency , ▁avail ability , ▁and ▁partition ▁toler ance . ▁P AC EL C ▁however ▁goes ▁further ▁and ▁states ▁that ▁another ▁trade - off ▁also ▁exists : ▁this ▁time ▁between ▁laten cy ▁and ▁consist ency , ▁even ▁in ▁absence ▁of ▁partitions , ▁thus ▁providing ▁a ▁more ▁complete ▁port ray al ▁of ▁the