[
https://issues.apache.org/jira/browse/JENA-1284?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15851303#comment-15851303
]
ASF GitHub Bot commented on JENA-1284:
--------------------------------------
Github user rvesse commented on the issue:
https://github.com/apache/jena/pull/212
My concern is that depending on the underlying storage of the data in the
graphs a call to `contains()` might be quite expensive and it would be more
efficient to simply call `delete()` directly.
You appear to have provided a flag to force the old behaviour so I think go
ahead and merge this. Since if any user does encounter performance regressions
we can advise them of the workaround and use a concrete report as the basis for
any further optimisation.
> 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)
