What data structures are more efficient than hash tables?

It is not possible to tell directly which data structure is more efficient than a hash table. It depends on the application. Every data structure has its own unique characteristics.

In some cases, bloom filter and trie works better than hash table.

Below I am just trying to give you an overview.

1. Longest prefix match in routing tables: In this case, the hash table will not be efficient. Here trie is better than hash table. Applications where the entries share common prefixes, it is better to implement with trie.
2. In case some applications where u just want to know where the content exists or not, then it is better to apply Bloom Filter, as it is very fast as compared to the hash table. It also consumes less memory. But the main drawback of the bloom filter is a false positive. It means when the answer is negative it is 100% correct but the in the other case sometimes it may be wrong.