...
- For a query that will return 1 out of N items, the best theoretical time complexity is constant, O(1).
- For a query that will return all N items, the best theoretical time complexity is linear, O(N).
Complexity of existing solution
As will be demonstrated by performance tests later in this document, the existing solution has the following performance characteristics:
...