Refactor sortmerge so that it can be disk based

Status: Inactive

Brought to you by: newmana

#117 Refactor sortmerge so that it can be disk based

Milestone: 0.5.6

Status: closed-fixed

Owner: Andrew Newman

Labels: SPARQL (9)

Priority: 7

Updated: 2009-11-19

Created: 2009-11-19

Private: No

The sort merge for joins is very confusing and hard to make non-memory bound.

Refactor it so that the creation of the intermediate data structures can be made disk based and break it up so that it's in smaller classes.

Andrew Newman - 2009-11-19

status: open --> closed-fixed
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:

Andrew Newman - 2009-11-19

Still more to do.

If you would like to refer to this comment somewhere else in this project, copy and paste the following link: