Task #11779 (closed)
Alt. impl. of graph processing
|Reported by:||jamoore||Owned by:||mtbcarroll|
|Keywords:||n.a.||Cc:||java@…, sethur2@…, k.h.gillen@…, spli@…|
Since the focus of much of beta3 will be graph processing, it is likely a good time to discuss an alternative implementation for processing graphs. It will be critical to judge what alternatives are possible and how long each might take to know whether or not this will be feasible for beta3.
Current "Rollback" strategy
Currently, the ome.services.graphs package uses `SAVEPOINT ...'` to mark sub-graphs which if not successful should not completely rollback the transaction. It's assumed that the overhead of these savepoints is one of the main limiting factors for DeleteI, ChgrpI, etc.
One alternative would be to read the graph specs and generate a list of SELECTs which will calculate whether or not to even enter into the subgraphs. If the known-to-fail UPDATEs (or DELETEs) are not called, then there'll be no reason to create a savepoint.