Are trie's used in vector databases?

In computer science, a trie, also called digital tree or prefix tree, is ‘a type of k-ary search tree, a tree data structure used for locating specific keys from within a set.’ These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters.

Or is it something different?