You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In the dmultimap, we use a bitvector to delimit sorted records and support rank/select queries.
Could the memory requirements for this be reduced if it were also built from disk backed structures, such as using https://github.com/stxxl/stxxl?
Once compressed, it is likely to be relatively small.
Another option would be to use DYNAMIC to build it in compressed space. This might have lower performance, but would be equivalent in terms of saving memory.
The text was updated successfully, but these errors were encountered:
In the dmultimap, we use a bitvector to delimit sorted records and support rank/select queries.
Could the memory requirements for this be reduced if it were also built from disk backed structures, such as using https://github.com/stxxl/stxxl?
Once compressed, it is likely to be relatively small.
Another option would be to use DYNAMIC to build it in compressed space. This might have lower performance, but would be equivalent in terms of saving memory.
The text was updated successfully, but these errors were encountered: