The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Minimal-change integrity maintenance using tuple deletions
Open accessAbstract
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are limited to tuple deletions. We focus on two basic computational issues: repair checking (is a database instance a repair of a given database?) and consistent query answers [in: ACM Symposium on Principles of Database Systems (PODS), 1999, 68] (is a tuple an answer to a given query in every repair of a given database?). We study the computational complexity of both problems, delineating the boundary between the tractable and the intractable cases. We consider denial constraints, general functional and inclusion dependencies, as well as key and foreign key constraints. Our results shed light on the computational feasibility of minimal-change integrity maintenance. The tractable cases should lead to practical implementations. The intractability results highlight the inherent limitations of any integrity enforcement mechanism, e.g., triggers or referential constraint actions, as a way of performing minimal-change integrity maintenance.
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
Handbook of theoretical computer science
Leeuwen, J. V. (1990) · Medical Entomology and Zoology · Cited by 4,259
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
Data integration: a theoretical perspective
Lenzerini, M. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543644 · Cited by 2,494
(1995) · Choice Reviews Online · doi:10.5860/choice.33-0359 · Cited by 1,754
Answering queries using views: A survey
Halevy, A. Y. (2001) · The VLDB Journal · doi:10.1007/s007780100054 · Cited by 1,510
Optimal implementation of conjunctive queries in relational data bases
Chandra, A. K., & Merlin, P. M. (1977) · Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 · doi:10.1145/800105.803397 · Cited by 1,224
The complexity of relational query languages (Extended Abstract)
Vardi, M. Y. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802186 · Cited by 1,184
Consistent query answers in inconsistent databases
Arenas, M., Bertossi, L., & Chomicki, J. (1999) · Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/303976.303983 · Cited by 868
Self-citationComplexity 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
Gärdenfors, P., & Rott, H. (2003) · Cited by 716
Cited by
HoloClean: holistic data repairs with probabilistic inference
Rekatsinas, T., Chu, X., Ilyas, I. F., & Ré, C. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137628.3137631 · Cited by 480
Conditional functional dependencies for capturing data inconsistencies
Fan, W., Geerts, F., Jia, X., & Kementsietsidis, A. (2008) · ACM Transactions on Database Systems · doi:10.1145/1366102.1366103 · Cited by 460
A cost-based model and effective heuristic for repairing constraints by value modification
Bohannon, P., Fan, W., Flaster, M., & Rastogi, R. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066175 · Cited by 424
Conditional Functional Dependencies for Data Cleaning
Bohannon, P., Fan, W., Geerts, F., Jia, X., & Kementsietsidis, A. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367920 · Cited by 375
Discovering Conditional Functional Dependencies
Fan, W., Geerts, F., Li, J., & Xiong, M. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.154 · Cited by 253
Metadata
- Authors
- Chomicki, J., & Marcinkowski, J.
- Venue
- Information and Computation
- Publisher
- Elsevier BV
- Published
- 2005-02
- Volume
- 197
- Issue
- 1-2
- Pages
- 90-121
- ISSN
- 0890-5401 (ISSN-L)
- OpenAlex
- W2163600218
- Cited by
- 347
- References
- 33
- FWCI
- 29.28
- Type
- journal article
- Language
- en
- Open access
- bronze
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.