 However, Bloom filters suffer from false positives.There exist data structures that may improve on binary search in some cases for both searching and other operations available for sorted arrays.For example, searches, approximate matches, and the operations available to sorted arrays can be performed more efficiently than binary search on specialized data structures such as van Emde Boas trees, fusion trees, tries, and bit arrays.