On Tue, Jun 29, 2021 at 1:17 PM Greg Miller <[email protected]> wrote:
> Robert- Just to clarify a little bit (slightly more caffeinated now): For the > cases where an indexed rectangle fits entirely within the query rectangle, > these would be "confirmed" matches up-front, relying on the efficiency of the > BKD-tree data structure (as you describe). The second phase confirmation I > had in mind were the cases where the query rectangle overlaps, or sits inside > the indexed rectangle, and the individual points/docs within the indexed > rectangle need to be checked against the boundaries of the query rectangle. > That step seemed like a good candidate for a second phase, effectively > avoiding that check if it doesn't end up being necessary. But, if that is > relatively rare compared to the case where an indexed shape fits entirely > within the query shape, then maybe there isn't value. It is rare/contained by definition, because it is a space-partitioned data structure. If there were a "lot" of these then BKD would form rectangles out of them and we'd check those rectangles instead. --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
