Previous: Trie String Key Pointer Value Arrays, Up: String Key Pointer Value Arrays [Index]

There are available split sorted string key pointer value associative arrays constructed over critical bit trees.

The critical bit tree associative array selects nodes with 1 bit. The tree is path compressed, is not prefix compressed.

• Critical Bit Tree Associative Array: |

The pointer critical bit tree associative array stores pointers to string keys (instead of string keys). It is otherwise same as the previous critical bit tree associative array.

• Pointer Critical Bit Tree Associative Array: |

The cached critical bit tree associative array stores a small number of bits adjacent to the critical bit with the tree nodes. The bits cache makes the final string comparison not always required. The associative array is otherwise same as the critical bit tree associative array.

• Cached Critical Bit Tree Associative Array: |