Sorry, you need to enable JavaScript to visit this website.

Revisiting compact RDF stores based on k2-trees

Primary tabs

Citation Author(s):
Nieves R. Brisaboa, Ana Cerdeira-Pena, Guillermo de Bernardo, Antonio Fariña
Submitted by:
Guillermo de Be...
Last updated:
26 March 2020 - 7:19am
Document Type:
Presentation Slides
Document Year:
2020
Event:
Presenters Name:
Guillermo de Bernardo

Abstract 

up
0 users have voted:

Comments

Thanks for the video presentation.
The idea with the k^2 trees nicely translates this relational problem to a geometric problem.
An intuitive approach for representing ST and OT would be to just write the first and the third component of the triples
in two separate wavelet trees. With these wavelet trees, you can answer the same queries like (s, p, ?).
Thinking geometrically, wavelet trees and k^2 trees share the idea to divide the space geometrically (alphabet size times number of tuples).
So my question would be whether such a representation would be interesting to study.

Dataset Files

base-newlogo.pdf

(109)