Cell-Probe Model data structure problem: f:X×Y→☑ database y∈Y
Cell-Probe Model database y 2 Y f : X ⇥ Y ! Z data structure problem:
Cell-Probe Mode data structure problem: f:X×Y→Z database y∈Y table code T w bits T:Y→∑s s cells (words) where∑={0,1}w
code T table Cell-Probe Model } w bits ( s cells (words) ⌃ = {0, 1}w where database y 2 Y T : Y ! ⌃s f : X ⇥ Y ! Z data structure problem:
Cell-Probe Model data structure problem: f:X×Y→☑ query x∈X database y∈Y table code T w bits T:Y→∑s s cells (words) where∑={0,1}w
code T table query x 2 X Cell-Probe Model } w bits ( s cells (words) ⌃ = {0, 1}w where database y 2 Y T : Y ! ⌃s f : X ⇥ Y ! Z data structure problem:
Cell-Probe Model data structure problem: f:X×Y→Z query x∈X f(x,y) database algorithm A: CPU y∈Y (decision tree) t adaptive table cell-probes code T w bits T:Y→∑s s cells (words) where∑={0,1}w
code T table query x 2 X t adaptive cell-probes Cell-Probe Model } w bits ( s cells (words) algorithm A: ⌃ = {0, 1}w where (decision tree) database y 2 Y T : Y ! ⌃s f : X ⇥ Y ! Z data structure problem: f(x, y)
Cell-Probe Model data structure problem: f:X×Y→☑ query x∈X f(x,y) database algorithm A: CPU y∈Y (decision tree) t adaptive table cell-probes code T w bits T:Y→∑s s cells (words) where∑={0,1}w protocol:the pair (A,T)
code T table query x 2 X t adaptive cell-probes Cell-Probe Model } w bits ( s cells (words) algorithm A: ⌃ = {0, 1}w where (decision tree) protocol: the pair (A, T) database y 2 Y T : Y ! ⌃s f : X ⇥ Y ! Z data structure problem: f(x, y)