Re: Parallel Application Processing

Mladen Gogala wrote:

> > Does this method make sense? Are there better methods to consider?
>
> Partitioning it by hash (or range, if you can do that) and then acessing
> different partitions in parallel would seem like the perfect way.

Oracle SE. Partitioning is not available.

Not that this partitioning is actually a solution in itself. One can simply specify the partition range as part of the predicate without needing to have partitioning. e.g.
select * from table where datetime between :date_from and :date_to

The problem with this is that the process now needs to go and determine what ranges of values it can process. Which date ranges ara valid candidates? Which date ranges are currently busy being processed? Which has not yet been processed? Which has been processed but failed processing?

How do you deal with these management complexities? Writing additional code? Adding tables to manage the processing? The more moving parts there are, the bigger the chance of failure. The slower performance.

Versus simply telling the process find *any* n number of rows that needs processing and doing its process & update thing. And running potentially 100's of these in parallel.

Sorry, I cannot see your suggestion as a viable solution.

--
Billy