Index Tree 指标树
local index tree 基于本地索引树
Binary Index Tree 树状数组
XML index tree XML索引树
tree index 饰她 ; 树形索引
Structure Index Tree 结构索引树
Nearly Optimal Search Index Tree 设计了次优查找索引树
motion index tree 运动检索树
In the data broadcast, the visits probability of the data record is various, therefore the index tree may be built through visit probability.
在数据广播中，数据记录被访问的概率各不相同，因此可以通过访问概率建立索引树。
The structure of the index tree decides the average index number to be visited, but even regarding the same index structure, the average visit time is different if the broadcast sequence is different.
索引树的结构决定了平均访问索引节点的数目，但是即使对于相同的索引结构，如果采用不同的广播序列，则平均访问时间也不尽相同。
Based on the former fact, we introduce the arithmetic coding algorithm based on binary index tree.
基于上述事实，本文引入了基于二进索引树的算术编码算法。
应用推荐