Hey @David Budiman from what I've been able to tell based on doing a bit of research, the time complexity for a spatial filter query in Druid can range from effectively constant time in the best case (where spatial indexing is highly efficient and the query covers a small, well-indexed area) to linear time in the worst case (where the query needs to scan a large number of points). However, in most practical scenarios, especially with proper indexing and reasonable data distribution, the performance will be closer to the more efficient end of this spectrum.