Tree community group: https://tree.linkeddatafragments.org/
Last Update:
Repository:

The diagrams present the historical performance tests run GitHub Commits based on the member extraction algorithm.

The results contain two separate parts:

- Executions on the inband dataset for extraction of 13 quads:

  • CBDAndBlankNode:Extraction only star-shapes (CBD) + blank nodes to be extracted.
  • CBDAndNamedGraphs:Extraction CBD + named graphs.
  • CBDAndSimpleShape:Extraction CBD + Simple Shape not adding any triples other than what CBD gives.
  • CBDAndSimpleShapeAndNamedGraphs: Extraction CBD + named graphs + Simple shape that does not add any triples other than already present.
  • CBDAndShaclExtended:Extraction Shape selecting specific property paths, but not too complex.
  • CBDAndShaclExtendedComplex:Extraction Complex shape with conditionals.

- Executions on the outband dataset for extraction of 40 quads of 10 members published on the web:

  • ExtractionCollectionMembers:Extraction 10 members from a Collection with 10 different nodes.
  • ExtractionMembersPartialOutBand:Extraction 10 members from 1 page, out of band, but each member has already a couple of triples in-band.
  • ExtractionMembersOutBand:Extraction 10 members from 1 page, but each member is out of band.
  • ExtractionCollection1000Members:Extraction 1000 members from a Collection with 1000 different nodes.
Mmeber Extraction Algorithm: https://treecg.github.io/specification/#member-extraction-algorithm