Containment of Conjunctive Queries with Negation: Algorithms and Experiments - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

Containment of Conjunctive Queries with Negation: Algorithms and Experiments

Abstract

We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other known algorithms in databases, and analyze it experimentally. Secondly, we present a new algorithm based on the translation of the containment problem into the problem of checking the unsatisfiability of a propositional logical formula, which allows us to use a SAT solver, and we experimentally compare both algorithms.
Fichier principal
Vignette du fichier
Containment_of_Conjunctive_Queries_with_Negation_A.pdf (456.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00537832 , version 1 (24-03-2024)

Identifiers

Cite

Khalil Ben Mohamed, Michel Leclère, Marie-Laure Mugnier. Containment of Conjunctive Queries with Negation: Algorithms and Experiments. DEXA 2010 - 21st International Conference on Database and Expert Systems Applications, Aug 2010, Bilbao, Spain. pp.330-345, ⟨10.1007/978-3-642-15251-1_27⟩. ⟨lirmm-00537832⟩
438 View
5 Download

Altmetric

Share

Gmail Facebook X LinkedIn More