3 ms·

Could you expand on that? Searching for the intersection of a set of tags' references seems like the epitome of a set/relational operation to me.

• joshu 17y ago
  You want an inverted index. Finding intersections with tags are multi-way joins, which are painful as all hell. At least on MySQL. Perhaps other databases do better. Note that I built probably the biggest platform of this type around.
  • gojomo 17y ago
    So the tags are terms, and each 'document' is... - a target (such as an URL in delicious)? - a [target, user] pairing? - a [target, user, tagging-event] tuple? Would you recommend using any of the off-the-shelf open-source inverted-index implementations? (Lucene, ferret, sphinx, [hyper]estraier, etc.?)
    • joshu 17y ago
      It depends on what you need, obviously. I think Lucene or Sphinx will take you a lot of the way. I don't know about the others.