Re: [PyIndexer] MySQL Stuff
Status: Pre-Alpha
Brought to you by:
cduncan
From: Casey D. <cas...@ya...> - 2001-12-17 03:17:00
|
[snip lots 'o stuff] > You could nest any number of queries like that. When > it comes to boolean searching, you can apply the > same logic, and retrieve all document ids that you > need to test further. Then generate an SQL list and > use the IN membership operator. [snip example] I was going to suggest this, but what if both words return 10,000 document hits? I doubt stuffing 10K ids into the IN operand of the SQL statment would work... But I do think that using heap tables would be quite efficient. I would think that would be the way to go, and just join against it in the second query. Maybe both methods could be used, using IN when there are 50 or fewer hits and heap tables otherwise. Again I think storing a document count for each word could help here. -Casey __________________________________________________ Do You Yahoo!? Check out Yahoo! Shopping and Yahoo! Auctions for all of your unique holiday gifts! Buy at http://shopping.yahoo.com or bid at http://auctions.yahoo.com |