K
Size: a a a
K
PK
K
K
PK
K
A
AR
AA
A
N
AA
OI
Obviously, no matter what approaches you take, querying EAV will not be as fast as
querying standard column-modeled relational data for certain types of query, in much the
same way that access of elements in sparse matrices are not as fast as those on non-
sparse matrices if the latter fit entirely into main memory. (Sparse matrices, represented
using structures such as linked lists, require list traversal to access an element at a given
X-Y position, while access to elements in matrices represented as 2-D arrays can be
performed using fast CPU register operations.) If, however, you chose the EAV approach
correctly for the problem that you were trying to solve, this is the price that you pay; in this
respect, EAV modeling is an example of a space (and schema maintenance) versus CPU-
time tradeoff.
A
ИМ
ИМ
ИМ
ИМ