What about Trie based search:
This started as an educational project but it can be useful in some cases. Trie is an interesting data structure that allows fast lookup of prefix matches. It is a tree of prefixes. Source: https://en.wikipedia.org/wiki/Trie In the B4X implementation, each node holds a character, a list of...
It has a full example.
If you stick with B4XSearch, there is an example here:
XUI Views is a b4x library (https://www.b4x.com/android/forum/threads/100383/#content). The same b4xlib library is compatible with B4A, B4i and B4J It is a collection of custom views and dialogs. Everything is written in B4X. The source code is included inside the b4xlib file, which is a zip...
If you get stuck with your project when you try one or the other, post your project and you will get help.