Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Poster OSTRICH: Versioned Random-Access Triple Store

72 views

Published on

Poster @TheWebConf 2018

Published in: Engineering
  • Be the first to comment

  • Be the first to like this

Poster OSTRICH: Versioned Random-Access Triple Store

  1. 1. OSTRICH Ruben.Taelman@UGent.be @rubensworks Versioned Random-Access Triple Store Storage strategy + Metadata Compressed delta chain Query capabilities Which books were present at time X? What was added/removed between X and Y? At what times was book A present? Query at versions Query between versions Query for versions n-1n-2n-3... n n-1n-2n-3... n n-1n-2n-3... n Store and query multiple RDF dataset versions in a single store Bonus features Cardinality estimation Supporting query plan optimization within query engines. Result streams Memory efficient processing of results. Efficient stream offsets Selecting subsets of results, like Triple Pattern Fragments paging

×