Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

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?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1053718]
[LanX]: (Pascale path)
[Eily]: paths like that
[Discipulus]: yes Eily++ (very keen) I want to integrate my project with a 17th experiments. I want to colorize in sequence all paths
[oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves.
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)
[LanX]: oh I meant fixed amount
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted
LanX #solved
[oiskuu]: I must watch Police Academy again sometime.

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2018-03-19 11:24 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.