Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: memory-efficient hash kind for incremental sort

by derby (Abbot)
on Jan 07, 2009 at 11:08 UTC ( #734603=note: print w/replies, xml ) Need Help??


in reply to memory-efficient hash kind for incremental sort

What you want is an inverted index engine that allows wildcard querying. I haven't played with any of the ones on cpan but prefer something along the lines of solr or it's base lucene (cpan's Kinosearch is very similar). Those search engines are going to provide with a lot more than what you've actually requested (that may be a good thing ... or maybe not).

-derby
  • Comment on Re: memory-efficient hash kind for incremental sort

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://734603]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2018-10-24 03:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    When I need money for a bigger acquisition, I usually ...














    Results (127 votes). Check out past polls.

    Notices?