Java – 500000 street names – data structure and purpose for fast search?

So we have many street names They came in with a document When starting servers in production, IDS may cache them The search should be done automatically, for example - for example, if you type 'Lang', you may get 8 clicks: langstr, langestr wait

Solution

What you are looking for is some kind of compressed trie representation You may want to start with succenct tries or dawg because they have excellent efficiency and very good space utilization

I hope this can help!