A method based on query caching and predicate substitution for the treatment of failing database queries

  • Authors:
  • Olivier Pivert;Hélène Jaudoin;Carmen Brando;Allel Hadjali

  • Affiliations:
  • Irisa – Enssat, University of Rennes 1, Technopole Anticipa, Lannion Cedex, France;Irisa – Enssat, University of Rennes 1, Technopole Anticipa, Lannion Cedex, France;IGN/Cogit, Saint-Mandé Cedex, France;Irisa – Enssat, University of Rennes 1, Technopole Anticipa, Lannion Cedex, France

  • Venue:
  • ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an approach aimed at obviating empty answers for a family of conjunctive queries involving value constraints. Contrary to the approaches based on a relaxation of the predicates involved in the query, the principle suggested here consists in replacing the query by a similar one which has been processed previously and whose answer is known to be non-empty. This technique thus avoids the combinatory explosion induced by classical relaxation-based approaches.