Revisiting compact RDF stores based on k2-trees

02/26/2020
by   Nieves R. Brisaboa, et al.
Universidade da Coruña
0

We present a new compact representation to efficiently store and query large RDF datasets in main memory. Our proposal, called BMatrix, is based on the k2-tree, a data structure devised to represent binary matrices in a compressed way, and aims at improving the results of previous state-of-the-art alternatives, especially in datasets with a relatively large number of predicates. We introduce our technique, together with some improvements on the basic k2-tree that can be applied to our solution in order to boost compression. Experimental results in the flagship RDF dataset DBPedia show that our proposal achieves better compression than existing alternatives, while yielding competitive query times, particularly in the most frequent triple patterns and in queries with unbound predicate, in which we outperform existing solutions.

READ FULL TEXT VIEW PDF

page 1

page 2

page 3

page 4

12/28/2018

Compact and Efficient Representation of General Graph Databases

In this paper, we propose a compact data structure to store labeled attr...
01/16/2013

Probabilistic Models for Query Approximation with Large Sparse Binary Datasets

Large sparse sets of binary transaction data with millions of records an...
11/19/2019

Extending General Compact Querieable Representations to GIS Applications

The raster model is commonly used for the representation of images in ma...
10/12/2018

Relative compression of trajectories

We present RCT, a new compact data structure to represent trajectories o...
11/19/2019

Improved Compressed String Dictionaries

We introduce a new family of compressed data structures to efficiently s...
12/28/2018

A Compact Representation for Trips over Networks built on self-indexes

Representing the movements of objects (trips) over a network in a compac...
02/18/2020

Compact Merkle Multiproofs

The compact Merkle multiproof is a new and significantly more memory-eff...

References