On 2007-02-27, Sam Mason <[EMAIL PROTECTED]> wrote: > In more human terms I would have a table of files, the purpose of which > is to give you the fileid (sort of like the inode number), a table of > tags that define what tags are known, and a table containing the pairs > (tag,fileid) that define what files have what tags.
Yeah, that's one quite simple layout, but how would you make the intersection of the search results for different tags then? A simple "same row" intersection doesn't work anymore. Does SQL have a more complicated intersection operation? And how efficient would it be? That's the bottleneck, I think. Plus there's no structure for quick access to a known file name, which would seem mportant to me. (Yes, I am total newbie wrt. SQL.) -- Tuomo
