[
https://issues.apache.org/jira/browse/JENA-1284?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15850623#comment-15850623
]
ASF GitHub Bot commented on JENA-1284:
--------------------------------------
Github user afs commented on the issue:
https://github.com/apache/jena/pull/212
@rvesse : It came up when reviewing code; I don't have figures either way.
We have situations of deleting small graphs from large ones and deleting large
graphs from small ones (and empty ones). The size ratios can be "small" being
down to 10 triples and large being 100k.
At the same time, this utility code must be robust again CCME on add/delete
during iteration. Just because one graph is not identical to another, does not
mean they are disconnected (e.g. inference graphs).
The code was always careful - if you can see cases where we can know
non-materialization is possible, please point to them. I'd be very happy to
exploit it.
> Improve GraphUtil operations by considering relative graph sizes.
> -----------------------------------------------------------------
>
> Key: JENA-1284
> URL: https://issues.apache.org/jira/browse/JENA-1284
> Project: Apache Jena
> Issue Type: Improvement
> Reporter: Andy Seaborne
> Assignee: Andy Seaborne
>
> Some of the bulk `GraphUtil` operations, `addInto` and `deleteFrom`, could be
> improved to loop on the smaller graph and have different algorithms depending
> on whether source or destination graph is smaller.
--
This message was sent by Atlassian JIRA
(v6.3.15#6346)
