Disc trie?

Question

I am trying to create a Trie , but on a mobile phone that has very limited memory capacity.

I realized that it is best to store the entire structure on disk and boot only as needed, as I can tolerate several reads on disk. But, after several attempts, it seems that this is a very difficult task.

What are the ways to store Trie on disk (i.e. only partially loaded) and save the quick search property?
Is this even a good idea to start with?

Answer 1

B-try disk-based string management answers your question.

This makes an observation:

As far as we know, in the literature there is still a proposal for a trie-based data structure, such as a batch trie, that can be efficiently on disk to support general string processing tasks.

Answer 2

I just took a quick look at this, but Shan's “Trie Methods for Text and Spatial Data on Secondary Storage” discusses the laid out trie views, and can be a useful starting point.