Why do you need to compare hashes? Is it important to have collisions or is this implementation for speed?
This sounds like an X/Y problem, where a person has problem X, jumps to solution Y, then starts asking how to do Y. wunder On Sep 19, 2013, at 6:10 AM, Gora Mohanty wrote: > On 19 September 2013 17:44, SachinMB <[email protected]> wrote: >> Hi all: >> >> I am working on a project where I need to build a search interface. But the >> catch is that the comparison should be between the hash values of the terms >> and not the terms. I have read a lot about Lucene but do not exactly know >> how to go about doing this. Can anyone tell me how to do that?? Please reply >> soon.. > > This question is better addressed to the user list, rather than > this dev list. > > What you want should not be very difficult, but it is probably > easier to get started with Solr rather than using Lucene directly. > Off the top of my head, you could add a token filter, possibly > along with a custom analyser. This would convert input for both > indexing and querying into the respective hashes. Please see > http://wiki.apache.org/solr > http://wiki.apache.org/solr/AnalyzersTokenizersTokenFilters > > I would also add that comparing hashes is not necessarily a > good idea: What benefit does it get you, and what happens in > case of collisions? > > Regards, > Gora > > --------------------------------------------------------------------- > To unsubscribe, e-mail: [email protected] > For additional commands, e-mail: [email protected] > -- Walter Underwood [email protected]
