Scalable Reasoning on Document Stores via Instance-Aware Query Rewriting - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2023

Scalable Reasoning on Document Stores via Instance-Aware Query Rewriting

Abstract

Data trees, typically encoded in JSON, are ubiquitous in data-driven applications. This ubiquity makes urgent the development of novel techniques for querying heterogeneous JSON data in a flexible manner. We propose a rule language for JSON, called constrained tree-rules, whose purpose is to provide a high-level unified view of heterogeneous JSON data and infer implicit information. As reasoning with constrained tree-rules is undecidable, we identify a relevant subset featuring tractable query answering, for which we design an automata-based query rewriting algorithm. Our approach consists of leveraging NoSQL document stores by means of a novel instance-aware query-rewriting technique. We present an extensive experimental analysis on large collections of several million JSON records. Our results show the importance of instance-aware rewriting as well as the efficiency and scalability of our approach.
Fichier principal
Vignette du fichier
TreeForceBDA23-post-proceedings.pdf (221.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY NC ND - Attribution - NonCommercial - NoDerivatives

Dates and versions

lirmm-04305822 , version 1 (24-11-2023)

Identifiers

  • HAL Id : lirmm-04305822 , version 1

Cite

Olivier Rodriguez, Federico Ulliana, Marie-Laure Mugnier. Scalable Reasoning on Document Stores via Instance-Aware Query Rewriting. BDA 2023 - 39e Conférence sur la Gestion de Données – Principes, Technologies et Applications, Oct 2023, Montpellier, France. ⟨lirmm-04305822⟩
40 View
8 Download

Share

Gmail Facebook X LinkedIn More