arne-bdt opened a new issue, #3902:
URL: https://github.com/apache/jena/issues/3902
### Version
6.2.0-SNAPSHOT
### Feature
`GaphMemIndexedSet `is based on the architecture of `GraphMemRoaring`, but
replaces the `RoaringBitmaps `by simple index-lists and a reverse index.
Benefits;
- memory footprint is comparable to GraphMemFast for smaller graphs up to 1M
triples. For larger graphs (BSBM 25M and 50M) the footprint is even smaller.
- `Graph#add` speed is comparable to `GraphMemFast` (depending on the graph)
- `Graph#delete` speed is faster than GraphMemFast, especially for large
graphs
- `Graph#find` / `#stream`:
- S__, _P_, O__ --> slightly slower than GraphMemFast
- SPO --> faster than GraphMemFast
- ___ --> faster than GraphMemFast
- SP_, S_O, _PO --> faster than GraphMemFast in most cases
- `Graph#contains`:
- SP_, S_O, _PO --> dependent on insert order --> _the only non-optimal
thing I discovered_
- other match pattern behave like `#find`
- `GraphMem#copy` --> fester than GraphMemFast
- supporting the same indexing strategies as GraphMemRoaring
### Are you interested in contributing a solution yourself?
Yes
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
