[algogeeks] Re: Large-scale full-text search: how to get the intersection list fast?
Please post it back if there are quick method. Actually, last time one friend got google interview, and was asked this question. Some say it is nlogm, if n << m. Also see here: http://groups.google.com/group/algogeeks/browse_frm/thread/6314d3437b1a172b?hl=en
[algogeeks] Re: Large-scale full-text search: how to get the intersection list fast?
OK. I found two downloadable seed papers from Google Scholar: 1. Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences 2. Alternation and Redundancy Analysis of the Intersection Problem