Complexity of In clause


Currently the DPU for using the in clause in integers is huge and scale fast.

Is there any expectation to reduce/improve it?

The algorithms for searching in ordered lists perform super well and don’t scale linearly how the costs of doing it in the DataSift.


The DPU cost of the IN clause is determined on a sliding scale. You can read more about it at the bottom of our Understanding Billing page.