overlapping ranges with priority

select .. from ranges_output_view where sku_group = s.sku_group;

end loop;

The predicate gets pushed down to the table, hence partition elimination kicks in and I can visit the input table one time only, one partition at a time, using a fraction of the resources at a time, and hence vastly improving performance.

And that naturally leads to “do-it-yourself parallelism”: running a job for every partition in parallel. I’m going to implement it since the customer is salivating about it … even if it is probably over-engineering :D .

Page 3 of 3 | Previous page

3 comments on this post.
  1. Overlapping ranges with priority | An Oracle Programmer:

    [...] few years ago, Alberto Dell’Era blogged about product prices with overlapping date ranges; “on an overlapping range, the strongest priority (lower number) wins.” His analysis, [...]

  2. Sam:

    I have similar problem, is there a way i can use your solution in Microsoft Access?

  3. Alberto Dell'Era:


    sorry but I know nothing about MS Access

Leave a comment