On 9/19/06, Domas Mituzas midom.lists@gmail.com wrote: [snip]
B+Trees are not that good for intersections, now maybe fulltext indexing in general is more suitable for such task, that would mean us using external facility for lookups like that (well, that was discussed in frankfurt 2005 ;-), but it is far more complex than to throw few more queries at our core databases and expecting a miracle.
[snip]
Or another database engine which supports an index type which is an inverted index with fast intersections.