afs commented on PR #1918:
URL: https://github.com/apache/jena/pull/1918#issuecomment-1605457513

   > To exclude the parsing part from the benchmarks, I usually parse the 
triples directly into an ArrayList first:
   
   I wanted to test the load-to-graph use pattern.  I gave the load-to-list a 
go, and the speed is well in excess of the parser which is as it should be 
(GraphMem2Faster 2.9 M triples/s vs GraphMem 1M triples/s). The heap size for 
100m BSBM falls in the deadzone of 32-40G where the runtime switches from 
compressed pointers to 64 bit pointers. BSBM has significant numbers of long 
literals.
   


-- 
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]

Reply via email to