The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Consistent query answering in databases
Abstract
For several reasons databases may become inconsistent with respect to a given set of integrity constraints (ICs): (a) The DBMS have no mechanism to maintain certain classes of ICs. (b) New constraints are imposed on preexisting, legacy data. (c) The ICs are soft, user, or informational constraints that are considered at query time, but without being necessarily enforced. (d) Data from different and autonomous sources are being integrated, in particular in mediator-based approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Data exchange: semantics and query answering
Fagin, R., Kolaitis, P. G., Miller, R. J., & Popa, L. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.10.033 · Cited by 1,206
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Cited by
Data Cleaning: Overview and Emerging Challenges
Chu, X., Ilyas, I. F., Krishnan, S., & Wang, J. (2016) · Proceedings of the 2016 International Conference on Management of Data · doi:10.1145/2882903.2912574 · Cited by 488
Database Repairing and Consistent Query Answering
Bertossi, L. (2011) · Synthesis Lectures on Data Management · doi:10.1007/978-3-031-01883-1 · Cited by 262
Self-citationBoselli, R., Cesarini, M., Mercorio, F., & Mezzanzanica, M. (2014) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v24i1.13667 · Cited by 24
“As a drawback finding consistent answers to aggregate queries becomes NP-complete already using two (or more) FDs, as observed by Bertossi(2006). To mitigate this problem, a number of promising heuristics approaches have”
Background
Metadata
- Authors
- Bertossi, L.
- Venue
- ACM SIGMOD Record
- Published
- 2006-06
- Volume
- 35
- Issue
- 2
- Pages
- 68-76
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2046769817
- Cited by
- 198
- References
- 2
- FWCI
- 20.51
- Type
- journal article
- Language
- en
- Open access
- closed
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.