Aidan Hogan

Worst-Case Optimal Graph Joins in Almost No Space

2021

We present an indexing scheme that supports worst-case optimal (wco) joins over graphs within compact space. Supporting all possible wco joins using conventional data structures - based on B(+)-Trees, tries, etc. - requires 6 index …

Semantics and canonicalisation of SPARQL 1.1

2022 · Semantic Web

We define a procedure for canonicalising SPARQL 1.1 queries. Specifically, given two input queries that return the same solutions modulo variable names over any RDF graph (which we call congruent queries), the canonicalisation procedure aims …