Re: Which Elisp data structure is fastest for searching?

[Joel Reicher <joel.reicher@gmail.com>]

Jean Louis <bugs@gnu.support> writes:

[...]

> As is written in manual that hash table is very fast, I believe 
> yes, though my search may not be.
>
> I will use following approach:
>
> - there will be list or hash with values that are to be 
> searched, 
>   those values will have their ID, that information will be 
>   prepared for easier searching, like special symbols removed, 
>   only words remaining, maybe even small words could be removed

This makes me think you don't yet know what your equality 
predicate is, and whether your search space is totally or 
partially ordered, or unordered.

I don't think you will be able to choose a data structure until 
you have these things figured out.

> - there will be different hash with accurate information about 
> the ID, 
>   such as title, URL, description

I am not sure you are using the word "hash" the same way "hash 
table" does, but if I'm right about the above, it doesn't matter, 
because you must figure those things out first.

> That is approach I know. Then I can give relevant information 
> for website search.
>
> I wonder if Emacs can remain in memory keeping to answer HTTP 
> requests, so that I do not load it every time.

Yes it can, but I think worrying about that now is a bit like 
worrying about how long to age the cheese when you haven't even 
milked the cow.

Regards,

        - Joel