[jira] [Commented] (JENA-44) Support external sorting of bindings in ARQ

["Paolo Castagna (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/JENA-44?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13078629#comment-13078629 ] 

Paolo Castagna commented on JENA-44:
------------------------------------

New ARQ and TDB SNAPSHOTs with the latest (i.e. [JENA-44_ARQ_r8724.patch|https://issues.apache.org/jira/secure/attachment/12477870/JENA-44_ARQ_r8724.patch]) patch applied are here:
http://oss.talisplatform.com/content/repositories/talis-snapshots/com/hp/hpl/jena/arq/2.8.9-JENA_44-SNAPSHOT/
http://oss.talisplatform.com/content/repositories/talis-snapshots/com/hp/hpl/jena/tdb/0.8.11-JENA_44-SNAPSHOT/
If you try them, please, report back any problem.

> Support external sorting of bindings in ARQ
> -------------------------------------------
>
>                 Key: JENA-44
>                 URL: https://issues.apache.org/jira/browse/JENA-44
>             Project: Jena
>          Issue Type: New Feature
>          Components: ARQ
>            Reporter: Sam Tunnicliffe
>            Assignee: Paolo Castagna
>            Priority: Minor
>         Attachments: JENA-44-0.patch, JENA-44_ARQ_r8531.patch, JENA-44_ARQ_r8724.patch
>
>
> In QueryIterSort, the sorting of the contents of an Iterator<Binding> is done in memory, using Arrays.sort. This can be problematic where the set to be sorted is large. A possible solution could be to use an external, disk-backed algorithm. A hybrid approach may be better, whereby we attempt the in-memory sort, but when the number of bindings encountered goes over a certain number, resort to the disk-backed variant.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira