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. Tessa:

    Unquestionably believe that which you said. Your favorite justification appeared to be
    on the net the easiest thing to be aware of.
    I say to you, I certainly get annoyed while people think about worries that they plainly do not know about.
    You managed to hit the nail upon the top and also defined out the whole thing without having side effect ,
    people can take a signal. Will likely be back to get more.
    Thanks

  3. mayanrocks.com:

    Greetings! I know this is kind of off topic but I was
    wondering if you knew where I could get a captcha
    plugin for my comment form? I’m using the same
    blog platform as yours and I’m having problems finding one?
    Thanks a lot!

Leave a comment