Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Finding best matches

by keszler (Priest)
on Sep 12, 2013 at 13:11 UTC ( #1053718=note: print w/replies, xml ) Need Help??


in reply to Finding best matches

IMHO, the best approach would be to normalize the database. Unless every record has six keywords, no more, no less, ever, the keywords should be in their own table linked by some record id.

That said, I'm not seeing the Perl question here...

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1053718]
help
Chatterbox?
[Corion]: Oooh - I had another devious idea - "Host C" - a C language where every struct is 4K in size. This makes memory and disk access incredibly fast ;)
[Corion]: (because everything is aligned to a memory page and all pages can be read+written directly from disk without buffering)

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2017-04-25 08:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (449 votes). Check out past polls.