You can view the full text of this article for free using the link below.

Title: Hash-processing of universal quantification-like queries dealing with requirements and prohibitions

Authors: Noussaiba Benadjimi; Khaled-Walid Hidouci

Addresses: Laboratoire de la Communication dans les Systmes Informatiques, Ecole nationale Supérieure d'Informatique, BP 68M, 16309, Oued-Smar, Alger, Algeria ' Laboratoire de la Communication dans les Systmes Informatiques, Ecole nationale Supérieure d'Informatique, BP 68M, 16309, Oued-Smar, Alger, Algeria

Abstract: This paper is focused on flexible universal quantification-like queries handling simultaneously positive and negative preferences (requirements or prohibitions). We emphasise the performance improvement of the considered operator by proposing new variants of the classical hash-division algorithm. The issue of answers ranking is also dealt with. We target in our work the in memory databases systems (also called main-memory database systems) with a very large volume of data. In these systems, all the data is primarily stored in the RAM of a computer. We have introduced a parallel implementation of the operator that takes into account the data skew issue. Our empirical analysis for both sequential and parallel versions shows the relevance of our approach. They demonstrate that the new processing of the mixed operator in a main-memory database achieves better performance compared to the conventional ones, and becomes faster through parallelism.

Keywords: universal quantification queries; relational division; relational anti-division; main-memory databases; flexible division; hash-division.

DOI: 10.1504/IJDMMM.2021.112921

International Journal of Data Mining, Modelling and Management, 2021 Vol.13 No.1/2, pp.192 - 210

Received: 31 Jul 2018
Accepted: 03 Sep 2019

Published online: 22 Jan 2021 *

Full-text access for editors Access for subscribers Free access Comment on this article