Need some insight into how intersectScans work. All I have to go on is this article:https://dzone.com/articles/performance-ingredients-for-nosql-intersect-scans
I’m having an issue where I have an intersect scan that involves two index scans:
the first returns x items and the second returns y=(x-z) items.
the intersect scan takes in (x+y) items and returns x items (the max of its inputs)
I’m missing something big, how is that possible. I’m guessing it’s a performance optimization where beyond some threshold of something, the engine just gives up and returns the larger results set?
(not an academic problem…after the 50,000 doc fetch and re-application of predicates, the result set = 163, really need to get this right.)
Please help. (CB v6 Enterprise)