Querying Key-Value Stores under Single-Key Constraints: Rewriting and Parallelization - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2019

Querying Key-Value Stores under Single-Key Constraints: Rewriting and Parallelization

Abstract

We consider the problem of querying key-value stores in thepresence of semantic constraints, expressed as rules on keys, whose pur-pose is to establish a high-level view over a collection of legacy databases.We focus on the rewriting-based approach for data access, which is themost suitable for the key-value store setting because of the limited ex-pressivity of the data model employed by such systems. Our main con-tribution is a parallel technique for rewriting and evaluating tree-shapedqueries under constraints which is able to speed up query answering. Weimplemented and evaluated our parallel technique. Results show signif-icant performance gains compared to the baseline sequential approach.
Fichier principal
Vignette du fichier
main-RuleML19.pdf (328.7 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

lirmm-02195593 , version 1 (26-07-2019)

Identifiers

Cite

Olivier Rodriguez, Reza Akbarinia, Federico Ulliana. Querying Key-Value Stores under Single-Key Constraints: Rewriting and Parallelization. RuleML+RR 2019 - 3rd International Joint Conference on Rules and Reasoning, Sep 2019, Bolzano, Italy. pp.198-206, ⟨10.1007/978-3-030-31095-0_15⟩. ⟨lirmm-02195593⟩
91 View
207 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More