 However, as the table becomes filled with more elements, open addressing's performance degrades exponentially.Additionally, separate chaining uses less memory in most cases, unless the entries are very small (less than four times the size of a pointer).Another common approach is to implement an associative array with a self-balancing binary search tree, such as an AVL tree or a red-black tree.