Towards Diversity-tolerant RDF-stores

09/10/2022
by   Masoud Salehpour, et al.
0

We propose a novel approach to designing RDF-stores with the goal of improving the consistency and predictability of query performance. When designing these systems, three properties are commonly desired: support for the full range of SPARQL query features (Q), support for widely varying RDF datasets in terms of structuredness and size (S), and high performance (P). We develop the empirical SPQ conjecture which states that it may be impossible to achieve all the three desiderata simultaneously. We present a strong case for its plausibility based on our experimental results. The tradeoffs among the three and design guidelines based on the SPQ conjecture are also discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2017

Eclipse: Practicability Beyond 1NN and Skyline

In this paper, we propose a novel Eclipse query which is more practical ...
research
11/08/2022

Analyzing a Seneta's conjecture by using the Williamson transform

Considering slowly varying functions (SVF), Seneta in 2019 conjectured t...
research
04/20/2020

Further Evidence Towards the Multiplicative 1-2-3 Conjecture

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kaz...
research
05/10/2016

The Yahoo Query Treebank, V. 1.0

A description and annotation guidelines for the Yahoo Webscope release o...
research
12/21/2020

A Journey to the Frontiers of Query Rewritability

This paper is about (first order) query rewritability in the context of ...
research
05/15/2019

Strong chromatic index and Hadwiger number

We investigate the effect of a fixed forbidden clique minor upon the str...

Please sign up or login with your details

Forgot password? Click here to reset