A Polystore Querying System Applied to Heterogeneous and Horizontally Distributed Data

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data storage in various systems such as SQL and NoSQL leads to important problems when trying to unify data querying. Multiple storage systems conduct to heterogeneous data structures and to multiple query languages. In the context of horizontally and disjointed distributed data, this paper proposes a system that allows the user to natively query a polystore system without taking care of data distribution and heterogeneity. Our approach relies on two mechanisms: (i) mapping dictionaries to define the navigation between systems, (ii) operator rewriting mechanisms from native query operators (selection, projection, aggregation and join) to execute queries on any polystore system. Using a dataset from TPC-H benchmark and a horizontally distributed between document and relational database management system, we conduct experiments showing that the rewriting process has a minimum impact when compared to executing queries in both systems.

Cite

CITATION STYLE

APA

El Ahdab, L., Teste, O., Megdiche, I., & Peninou, A. (2023). A Polystore Querying System Applied to Heterogeneous and Horizontally Distributed Data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14146 LNCS, pp. 437–442). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-39847-6_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free