Unified-Processing of Flexible Division Dealing with Positive and Negative Preferences

Abstract : Nowadays, current trends of universal quantification-based queries are been oriented towards flexible ones (tolerant queries and-or those involving preferences). In this paper, we are interested in universal quantification-like queries dealing with both positive or negative preferences (requirements or prohibitions), considered separately or simultaneously. We have emphasised the improvement of the proposed operator, by designing new variants of the classical Hash-Division algorithm, presented in [1], for dealing with our context. The parallel implementation is also presented, and the issue of answers ranking is dealt with. Computational experiments are carried out in both sequential and parallel versions. They shows the relevance of our approach and demonstrate that the new operator outperforms the conventional one with respect to performance (the gain exceeds a ratio of 40).
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

Contributor : Hal Ifip <>
Submitted on : Wednesday, November 7, 2018 - 11:06:35 AM
Last modification on : Thursday, November 8, 2018 - 10:26:49 AM
Long-term archiving on : Friday, February 8, 2019 - 1:46:32 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2021-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Noussaiba Benadjimi, Walid Hidouci. Unified-Processing of Flexible Division Dealing with Positive and Negative Preferences. 6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA), May 2018, Oran, Algeria. pp.635-647, ⟨10.1007/978-3-319-89743-1_54⟩. ⟨hal-01913925⟩



Record views