login

Consistent query answers in inconsistent databases

Published 1 May 1999Open access
Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki
Citations883
View PDF

TL;DR

The problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints is considered and its soundness and completeness are proved.

Abstract

Article Free Access Share on Consistent query answers in inconsistent databases Authors: Marcelo Arenas Pontificia Universidad Católica de Chile, Escuela de Ingeniería, Departamento de Ciencia de Computación, Casilla 306, Santiago 22, Chile Pontificia Universidad Católica de Chile, Escuela de Ingeniería, Departamento de Ciencia de Computación, Casilla 306, Santiago 22, ChileView Profile , Leopoldo Bertossi Pontificia Universidad Católica de Chile, Escuela de Ingeniería, Departamento de Ciencia de Computación, Casilla 306, Santiago 22, Chile Pontificia Universidad Católica de Chile, Escuela de Ingeniería, Departamento de Ciencia de Computación, Casilla 306, Santiago 22, ChileView Profile , Jan Chomicki Monmouth University, Department of Computer Science, West Long Branch, NJ Monmouth University, Department of Computer Science, West Long Branch, NJView Profile Authors Info & Claims PODS '99: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsMay 1999 Pages 68–79https://doi.org/10.1145/303976.303983Online:01 May 1999Publication History 551citation1,242DownloadsMetricsTotal Citations551Total Downloads1,242Last 12 Months61Last 6 weeks10 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Keywords

Computer Science