The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
Database Repairing and Consistent Query Answering
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
The value of the world's ecosystem services and natural capital
Costanza, R., d'Arge, R., de Groot, R., Farber, S., Grasso, M., Hannon, B., Limburg, K., Naeem, S., O'Neill, R. V., Paruelo, J., et al. (1997) · Nature · doi:10.1038/387253a0 · Cited by 22,585
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
A relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Managing the health effects of climate change
Costello, A., Abbas, M., Allen, A., Ball, S., Bell, S., Bellamy, R., Friel, S., Groce, N., Johnson, A., Kett, M., et al. (2009) · The Lancet · doi:10.1016/s0140-6736(09)60935-1 · Cited by 3,102
A Greedy Heuristic for the Set-Covering Problem
Chvatal, V. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.3.233 · Cited by 2,581
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Classical negation in logic programs and disjunctive databases
Gelfond, M., & Lifschitz, V. (1991) · New Generation Computing · doi:10.1007/bf03037169 · Cited by 2,259
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
Parameterized Complexity Theory
(2006) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/3-540-29953-x · Cited by 1,869
Bleiholder, J., & Naumann, F. (2009) · ACM Computing Surveys · doi:10.1145/1456650.1456651 · Cited by 1,838
Knowledge Representation, Reasoning and Declarative Problem Solving
Baral, C. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511543357 · Cited by 1,413
Duplicate Record Detection: A Survey
Elmagarmid, A. K., Ipeirotis, P. G., & Verykios, V. S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.250581 · Cited by 1,267
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
The DLV system for knowledge representation and reasoning
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006) · ACM Transactions on Computational Logic · doi:10.1145/1149114.1149117 · Cited by 1,151
Ebbinghaus, H.-D., & Flum, J. (1995) · Springer Monographs in Mathematics · doi:10.1007/3-540-28788-4 · Cited by 1,124
Incomplete Information in Relational Databases
Imieliński, T., & Lipski, W. (1984) · Journal of the ACM · doi:10.1145/1634.1886 · Cited by 1,013
Efficient query evaluation on probabilistic databases
Dalvi, N., & Suciu, D. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0004-3 · Cited by 962
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-citationThe Classical Decision Problem
Börger, E., Grädel, E., & Gurevich, Y. (1997) · Springer eBooks · doi:10.1007/978-3-642-59207-2 · Cited by 816
On the Desirability of Acyclic Database Schemes
Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. (1983) · Journal of the ACM · doi:10.1145/2402.322389 · Cited by 808
Logic Programming and Databases
Ceri, S., Gottlob, G., & Tanca, L. (1990) · Surveys in Computer Science · doi:10.1007/978-3-642-83952-8 · Cited by 747
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
Towards a Logical Reconstruction of Relational Database Theory
Reiter, R. (1984) · Topics in information systems · doi:10.1007/978-1-4612-5196-5_8 · Cited by 585
Swoosh: a generic approach to entity resolution
Benjelloun, O., García-Molina, H., Menestrina, D., Su, Q., Whang, S. E., & Widom, J. (2008) · The VLDB Journal · doi:10.1007/s00778-008-0098-x · Cited by 489
Eiter, T., Gottlob, G., & Mannila, H. (1997) · ACM Transactions on Database Systems · doi:10.1145/261124.261126 · Cited by 488
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
XSB as an efficient deductive database engine
Sagonas, K., Swift, T., & Warren, D. S. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191927 · Cited by 321
Geels, F. W. (2006) · Research Policy · doi:10.1016/j.respol.2006.06.001 · Cited by 277
Dependencies revisited for improving data quality
Fan, W. (2008) · Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1376916.1376940 · Cited by 240
Database repairing using updates
Wijsen, J. (2005) · ACM Transactions on Database Systems · doi:10.1145/1093382.1093385 · Cited by 208
On approximating optimum repairs for functional dependency violations
Kolahi, S., & Lakshmanan, L. V. S. (2009) · Proceedings of the 12th International Conference on Database Theory · doi:10.1145/1514894.1514901 · Cited by 206
ConQuer: efficient management of inconsistent databases
Fuxman, A., Fazli, E., & Miller, R. J. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066176 · Cited by 205
Consistent query answering in databases
Bertossi, L. (2006) · ACM SIGMOD Record · doi:10.1145/1147376.1147391 · Cited by 198
Self-citationConsistent Query Answering: Five Easy Pieces
Chomicki, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11965893_1 · Cited by 197
Stable models and circumscription
Ferraris, P., Lee, J., & Lifschitz, V. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.04.011 · Cited by 194
Big Water, Everyday Water: A Sociotechnical Perspective
Sofoulis, Z. (2005) · Continuum · doi:10.1080/10304310500322685 · Cited by 194
Enhancing Disjunctive Datalog by constraints
Buccafurri, F., Leone, N., & Rullo, P. (2000) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.877512 · Cited by 191
Logic programming and knowledge representation—The A-Prolog perspective
Gelfond, M., & Leone, N. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00207-2 · Cited by 188
An efficient fixed-parameter algorithm for 3-Hitting Set
Niedermeier, R., & Rossmanith, P. (2003) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00009-1 · Cited by 159
Repair checking in inconsistent databases: algorithms and complexity
Afrati, F., & Kolaitis, P. G. (2009) · International Conference on Database Theory · doi:10.1145/1514894.1514899 · Cited by 150
First-order query rewriting for inconsistent databases
Fuxman, A. D., & Miller, R. J. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2006.10.013 · Cited by 142
Computing Circumscription Revisited: A Reduction Algorithm
Doherty, P., Łukaszewicz, W., & Szałas, A. (1997) · Journal of Automated Reasoning · doi:10.1023/a:1005722130532 · Cited by 134
Interaction between record matching and data repairing
Fan, W., Li, J., Ma, S., Tang, N., & Yu, W. (2011) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/1989323.1989373 · Cited by 116
Extending dependencies with conditions
Bravo, L., Fan, W., & Ma, S. (2007) · Edinburgh Research Explorer (University of Edinburgh) · Cited by 107
Computing consistent query answers using conflict hypergraphs
Chomicki, J., Marcinkowski, J., & Staworko, S. (2004) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1031171.1031254 · Cited by 100
Bertossi, L., Bravo, L., Enrico Franconi, B., & Lopatenko, A. (2008) · Information Systems · doi:10.1016/j.is.2008.01.005 · Cited by 99
Self-citationThe complexity of optimization problems
Krentel, M. W. (1986) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/12130.12138 · Cited by 96
The consistency extractor system: Answer set programs for consistent query answering in databases
Caniupán, M., & Bertossi, L. (2010) · Data & Knowledge Engineering · doi:10.1016/j.datak.2010.01.005 · Cited by 94
Self-citationData cleaning and query answering with matching dependencies and matching functions
Bertossi, L., Kolahi, S., & Lakshmanan, L. V. S. (2011) · International Conference on Database Theory · doi:10.1145/1938551.1938585 · Cited by 70
Self-citationLogic Programs for Querying Inconsistent Databases
Barceló, P., & Bertossi, L. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36388-2_15 · Cited by 65
Self-citationAnswering aggregate queries in data exchange
Afrati, F., & Kolaitis, P. G. (2008) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1376916.1376936 · Cited by 60
Repair localization for query answering from inconsistent databases
Eiter, T., Fink, M., Greco, G., & Lembo, D. (2008) · ACM Transactions on Database Systems · doi:10.1145/1366102.1366107 · Cited by 60
Wijsen, J. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807111 · Cited by 53
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Eiter, T., & Gottlob, G. (1992) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/137097.137886 · Cited by 53
Programming with non-determinism in deductive databases
Giannotti, F., Greco, S., Saccà, D., & Zaniolo, C. (1997) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018999404360 · Cited by 44
Towards Inconsistency Management in Data Integration Systems.
Fuxman, A. D., & Miller, R. J. (2003) · Cited by 25
Pruning Operators for Disjunctive Logic Programming Systems
Calimeri, F., Faber, W., Pfeifer, G., & Leone, N. (2006) · Fundamenta Informaticae · doi:10.3233/fun-2006-712-303 · Cited by 22
The socio-technology of indirect potable water reuse
Bell, S. J., & Aitken, V. (2008) · Water Science & Technology Water Supply · doi:10.2166/ws.2008.104 · Cited by 19
Glass half empty? Urban water poverty halfway through the Decade of Water for Life
Allen, A., & Bell, S. J. (2011) · International Journal of Urban Sustainable Development · doi:10.1080/19463138.2011.583530 · Cited by 15
Polynomial time queries over inconsistent databases with functional dependencies and foreign keys
Molinaro, C., & Greco, S. (2010) · Data & Knowledge Engineering · doi:10.1016/j.datak.2010.02.007 · Cited by 15
Range-Consistent Answers of Aggregate Queries under Aggregate Constraints
Flesca, S., Furfaro, F., & Parisi, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15951-0_19 · Cited by 13
Exploiting Conflict Structures in Inconsistent Databases
Kolahi, S., & Lakshmanan, L. V. S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15576-5_25 · Cited by 6
Cited by
Discovering denial constraints
Chu, X., Ilyas, I. F., & Papotti, P. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536258.2536262 · Cited by 262
Interventional Fairness: Causal Database Repair for Algorithmic Fairness
Salimi, B., Rodriguez, L., Howe, B., & Suciu, D. (2019) · Proceedings of the 2019 International Conference on Management of Data · doi:10.1145/3299869.3319901 · Cited by 145
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
- Bertossi, L.
- Venue
- Synthesis Lectures on Data Management
- Publisher
- Springer International Publishing
- Published
- 2011
- ISSN
- 2153-5418 (ISSN-L)
- 2153-5426
- OpenAlex
- W1985239372
- Cited by
- 262
- References
- 66
- FWCI
- 13.07
- Type
- book
- 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.