For data values whose combined declared length is between these two bounds, Adaptive Server Anywhere uses a compressed B-tree index that stores each key in a compressed form.

• 对于声明长度介于这两个界限之间的数据值,Adaptive Server Anywhere会使用压缩的B树索引,它以压缩的形式存储每个键。