GL
об этом где-нибудь есть публичная информация?
из whitepaper:
The engine builds an inverted term index for the string column values. Each string value is analyzed and
split into normalized terms, and an ordered list of logical positions (i.e. containing record ordinals) is
recorded for each term. The resulting sorted list of terms and their associated positions is stored as an
immutable B-tree.
The engine builds an inverted term index for the string column values. Each string value is analyzed and
split into normalized terms, and an ordered list of logical positions (i.e. containing record ordinals) is
recorded for each term. The resulting sorted list of terms and their associated positions is stored as an
immutable B-tree.
