On hash bipolar division: An enhanced processing of novel and conventional forms of bipolar division

Abstract

In this paper, two issues of bipolar division are discussed. First, we outline some new operators dealing with the bipolar division, to enrich the interpretations of bipolar queries. In this context, we propose some extended operators of bipolar division based on the connector “or else”. Besides, we introduce a new bipolar division operator dealing with the “Satisfied-Dissatisfied approach”. Secondly, we highlight the matter of the performance improvement of the considered operators. Thus, we present an efficient method which allows handling several bipolar divisions with a unified processing. Our idea is to design new variants of the classical Hash-Division algorithm, for dealing with the bipolar division. The issue of answers ranking is also dealt with. Computational experiments are carried out and demonstrate that the new variants outperform the conventional ones with respect to performance.