|Welcome to the Monastery|
Re^3: What is the best way to store and look-up a "similarity vector"?by BrowserUk (Pope)
|on Nov 14, 2013 at 18:07 UTC||Need Help??|
I might receive more and more properties I haven't planned into my schema/bitmap/bitvector layout.
Use a two-step schema.
To select records, you build up a bit mask with bits set for the sought A/V pairs, and then AND it with each record. For similarity, count the resultant bits.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.