So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.

所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。

youdao

You can use a table as an array, a dictionary (also called a hash or an associative array), a tree, a record, and so on.

我们可以将表作为数组、字典(也称为散列或联合数组)、树、记录，等等。

youdao

Then for each hash value, a separate B+tree is created that contains only the remaining key parts following the hash columns.

然后，对于每个 hash 值，一个单独 B+tree 被创建，只包含 hash 列后面的其余关键部分。

youdao