3 ms·
An 'or' search doesn't increase things exponentially. In the simplest model of an 'or' search, each keyword returns a postings list, and the result is the unio
by eesmith 8y ago
An 'or' search doesn't increase things exponentially.
In the simplest model of an 'or' search, each keyword returns a postings list, and the result is the union of those lists. This is linear.
The size of the resulting list is at most N times the largest posting list.
In practice, the merger uses a weighting scheme so that documents with (say) 5 words of the 7 come before documents with (say) 3 of the 7.
And documents with all terms should be on the top of the list.
The merger is at worst N log(N) for the sort.
Most people only look at the first page, or first few pages of results, so it doesn't really matter, does it?
- smusamashah 8y agoOk. It's not exponential instead it's the sum of all n's. 3 keywords with 10 results each on its own, provided no other keyword was part of the result, will return 30 results when used together.
- eesmith 8y agoAnd ranked. Plus, "Most people only look at the first page, or first few pages of results, so it doesn't really matter, does it?"
- smusamashah 8y agoIf there are hundreds of results then sure I will not bother going through many pages. But if i am looking hard and see that there are only 2 pages, I might checkout all of them.
- eesmith 8y agoIt simply doesn't matter how many pages are returned as a count. Most people - indeed, nearly all - only look at the first page or two, no matter what. (PaulHoule pointed out that "researching patents" is one exception.) Google reports "532 000 000" results for 'chrome desktop'. Yet Google is pretty popular. People still use Google since the results they want are usually on the first page. Indeed, that's why people switched from AltaVista to Google; AltaVista often required trawling through tens of pages to find a good match.