Handling failing queries over uncertain databases

Belheouane, Chourouk; Jean, Stéphane; Hadjali, Allel; Asayesh, Hamid

doi:10.1109/fuzz-ieee.2017.8015476

Cited by 2 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, just as αLBA, their approach is designed to consider sets of thresholds, while we focus on a single certainty requirement provided by the user to reduce the size of the search space. Our previous approach, Matrix-Based Search (MBS) [3], computes XSSs and MFSs in the context of uncertain relational databases for relatively small queries (≤ 16 predicates). MBS is similar to MCS in its construction of a binary matrix, but with a single disjunctive query composed of the failing query's predicates.…”

Section: Related Workmentioning

confidence: 99%

“…However, as we will show in Section VI, this approach does not scale for large queries during the computation of MFSs. Indeed, according to [3], the MFS computation time of MBS exceeds 50% of the total for queries with 16 predicates or more. Yet, large queries are generated in a number of domains such as database integration, automated query formulation or graphical query languages.…”

Section: Related Workmentioning

confidence: 99%

“…MDMB computes the MFSs and XSSs in three steps: 1) computing a binary representation of succeeding subqueries, 2) extracting the XSSs, and 3) computing the MFSs. For completeness, steps 1 and 2 -from [3] -are outlined in this paper.…”

Section: Mdmb: a Mixed Dualization Matrix-based Approachmentioning

confidence: 99%

“…Implemented Algorithms. MDMB is an improvement of the MBS algorithm [3] to handle larger queries. MBS therefore acts as a baseline to evaluate the benefits of our optimization.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…In this paper, we substantially develop and improve the third step of this process over our previous work [3]. The novelty of this contribution consists in identifying and defining the requirements for dualization, proving its applicability for the empty answer problem, and evaluating its performance benefits.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Borders of Theories for Cooperative Querying over Uncertain Databases

Belheouane¹,

Jean²,

Chardin³

et al. 2018

2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

Self Cite

View full text Add to dashboard Cite

In many real applications, data are intrinsically uncertain due to measurement errors, interpretability issues, information incompleteness, etc. In those uncertain databases, users usually express quality requirements when the system evaluates their queries. However, as they may not be familiar with the contents of the queried database, their queries may be failing i.e., they may return no results or results that do not satisfy the expected degree of certainty. To provide users with relevant information in order to obtain alternative satisfactory results, we introduce a cooperative approach based on the dualization concept. This approach computes a set of meaningful subqueries (MFSs and XSSs) of the initial failing query, which is of paramount importance for query reformulation and relaxation purposes. The conducted experiments show that our proposition, a Mixed Dualization Matrix-Based approach (MDMB), outperforms existing algorithms, especially for large queries.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Mdmb: a Mixed Dualization Matrix-based Approachmentioning

confidence: 99%

“…Implemented Algorithms. MDMB is an improvement of the MBS algorithm [3] to handle larger queries. MBS therefore acts as a baseline to evaluate the benefits of our optimization.…”

Section: Experimental Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations