Suppose you want to encode the bit string "1110011."
假设您要对一个比特串“1110011”进行编码。
Inversion lists are best described as a condensed summary of a bit string.
对倒排表的最好描述是:它是对比特串的压缩表示。
All we store is the start position of the 1s, then the start position of the 0s, then the position of 1s again, and so on until the bit string is over.
我们存储的是,开始出现1的位置,开始出现0的位置,然后再是出现1的位置,如此重复直到比特串结束。
There are much better compression algorithms; this is just a demonstration of how inversion lists can be applied to wider channels than a single bit string.
还可以有更好的压缩算法;这不过是为了证明倒排表可以用于比单个比特更宽的通道。
In addition, we add a bit string to each node in the tree to store the prefix of the items. By using the structure we can avoid repeatedly traversing the sub-tree while expanding the patterns.
除此之外,算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目,以避免在模式扩展的时候频繁的遍历子树。
A character string or a bit string considered as an entity.
作为一个实体的一组字符串或一组字位串。
This specifies a key as a 13-character (104-bit) string.
它将密钥指定为 13个字符(104位)的字符串。
This specifies a key as a 13-character (104-bit) string.
它将密钥指定为 13个字符(104位)的字符串。
应用推荐