The DOI matches its Crossref record.
Consistent query answers in inconsistent databases
Open accessAbstract
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints.This notion is captured in terms of the possible repaired versions of the database.A rnethod for computing consistent answers is given and its soundness and completeness (for some classes of constraints and queries) proved.The method is based on an iterative procedure whose termination for several classes of constraints is proved as well.Permission to make digital or hard copies of all or part of this work 1'01 personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the fill1 citation on the iirst page.To copy otherwise, to republish, to post on servers or to redistribute to lists.rcquircs prior specific
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A Bayesian approach to discovering truth from conflicting sources for data integration
Zhao, B., Rubinstein, B. I. P., Gemmell, J., & Han, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2168651.2168656 · Cited by 264
Conflict resolution with data currency and consistency
Fan, W., Geerts, F., Tang, N., & Yu, W. (2014) · Journal of Data and Information Quality · doi:10.1145/2631923 · Cited by 30
Metadata
- Authors
- Arenas, M., Bertossi, L., & Chomicki, J.
- Venue
- Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 1999-05
- Pages
- 68-79
- OpenAlex
- W2077518845
- Cited by
- 868
- References
- 0
- FWCI
- 5.98
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
