The DOI matches its Crossref record, with a small difference in title or year; 37 of the 40 references it cites were found in a registry or an index.
Data exchange: semantics and query answering
Open accessOverview
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Data exchange research [12] addresses cross-boundary consistency but not privacy-preserving forgetting over an evolving state trajectory.”
From Is Agent Memory a Database? Rethinking Data Foundations for Long-Term AI Agent Memory (2026) · cites this paper as [12]
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 integration: a theoretical perspective
Maurizio Lenzerini, B. (2002) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/543613.543644 · Cited by 2,578
The complexity of satisfiability problems
Schaefer, T. J. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804350 · Cited by 1,737
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
Testing implications of data dependencies
Maier, D., Mendelzon, A. O., & Sagiv, Y. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320115 · Cited by 582
Levy, A. Y., Mendelzon, A. O., Sagiv, Y., & Srivastava, D. (1999) · The MIT Press eBooks · doi:10.7551/mitpress/4472.003.0012 · Cited by 538
Complexity of answering queries using materialized views
Abiteboul, S., & Duschka, O. M. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275516 · Cited by 483
Popa, L., Velegrakis, Y., Miller, R. J., Hernández, M. A., & Fagin, R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50059-7 · Cited by 444
Self-citationSchema Mapping as Query Discovery
Miller, R. J., Haas, L. M., & Hernández, M. A. (2000) · Very Large Data Bases · Cited by 438
Self-citationA Proof Procedure for Data Dependencies
Beeri, C., & Vardi, M. Y. (1984) · Journal of the ACM · doi:10.1145/1634.1636 · Cited by 415
Answering queries using views (extended abstract)
Levy, A. Y., Mendelzon, A. O., & Sagiv, Y. (1995) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/212433.220198 · Cited by 407
Horn clauses and database dependencies
Fagin, R. (1982) · Journal of the ACM · doi:10.1145/322344.322347 · Cited by 380
Self-citationData exchange: getting to the core
Fagin, R., Kolaitis, P. G., & Popa, L. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061323 · Cited by 377
Self-citationOn the foundations of the universal relation model
Maier, D., Ullman, J. D., & Vardi, M. Y. (1984) · ACM Transactions on Database Systems · doi:10.1145/329.318580 · Cited by 286
Inclusion dependencies and their interaction with functional dependencies
Casanova, M. A., Fagin, R., & Papadimitriou, C. H. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90075-8 · Cited by 260
Self-citationData integration under integrity constraints
Calì, A., Calvanese, D., Giacomo, G. D., & Maurizio Lenzerini, B. (2003) · Information Systems · doi:10.1016/s0306-4379(03)00050-4 · Cited by 250
Navigational plans for data integration
Friedman, M., Levy, A. Y., & Millstein, T. D. (1999) · Cited by 238
Hell, P., & Nešetřil, J. (1992) · Discrete Mathematics · doi:10.1016/0012-365x(92)90282-k · Cited by 218
Recursive query plans for data integration
Duschka, O. M., Genesereth, M., & Levy, A. Y. (2000) · The Journal of Logic Programming · doi:10.1016/s0743-1066(99)00025-4 · Cited by 194
Reformulation of XML Queries and Constraints
Deutsch, A., & Tannen, V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36285-1_15 · Cited by 180
Logics for Databases and Information Systems
Chomicki, J., Saake, G., Saake, G., Bonner, A. J., & Kifer, M. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5643-5 · Cited by 169
ILOG : Declarative creation and manipulation of object identifiers (extended abstract)
Hull, R. B., & Yoshikawa, M. (1990) · Cited by 156
Shu, N. C., Housel, B. C., Taylor, R. W., Ghosh, S., & Lum, V. Y. (1977) · ACM Transactions on Database Systems · doi:10.1145/320544.320549 · Cited by 151
On Monadic NP vs Monadic co-NP
Fagin, R., Stockmeyer, L. J., & Vardi, M. Y. (1995) · Information and Computation · doi:10.1006/inco.1995.1100 · Cited by 143
Self-citationLogical Approaches to Incomplete Information: A Survey
van der Meyden, R. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5643-5_10 · Cited by 140
Shu, N. C., Housel, B. C., & Lum, V. Y. (1975) · Communications of the ACM · doi:10.1145/361020.361023 · Cited by 111
The Complexity of Querying Indefinite Data about Linearly Ordered Domains
van der Meyden, R. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1455 · Cited by 95
Logics for databases and information systems
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)90193-1 · Cited by 93
Locally consistent transformations and query answering in data exchange
Arenas, M., Barceló, P., Fagin, R., & Libkin, L. O. (2004) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1055558.1055592 · Cited by 92
Self-citationHöfner, G. (1993) · Cited by 77
Correspondence and translation for heterogeneous data
Abiteboul, S., Cluet, S., & Milo, T. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62222-5_56 · Cited by 77
Why horn formulas matter in computer science: Initial structures and generic examples
Makowsky, J. A. (1987) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(87)90027-4 · Cited by 69
Optimization Properties for Classes of Conjunctive Regular Path Queries
Deutsch, A., & Tannen, V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46093-4_2 · Cited by 64
Correspondence and translation for heterogeneous data
Abiteboul, S., Cluet, S., & Milo, T. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00128-1 · Cited by 64
Functional and inclusion dependencies a graph theoretic approach
Cosmadakis, S. S., & Kanellakis, P. C. (1984) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/588011.588016 · Cited by 44
Functional and Inclusion Dependencies.
Cosmadakis, S. S., & Kanellakis, P. C. (1983) · Cited by 1
Cited by
Data integration: a theoretical perspective
Maurizio Lenzerini, B. (2002) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/543613.543644 · Cited by 2,578
Machine learning for neuroimaging with scikit-learn
Abraham, A., Pedregosa, F., Eickenberg, M., Gervais, P., Mueller, A., Kossaifi, J., Gramfort, A., Thirion, B., & Varoquaux, G. (2014) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2014.00014 · Cited by 2,384
Provenance in Databases: Why, How, and Where
Cheney, J., Chiticariu, L., & Tan, W.-C. (2009) · Foundations and Trends in Databases · doi:10.1561/1900000006 · Cited by 646
Overview and Framework for Data and Information Quality Research
Madnick, S. E., Wang, R. Y., Lee, Y. W., & Zhu, H. (2009) · Journal of Data and Information Quality · doi:10.1145/1515693.1516680 · Cited by 419
A general Datalog-based framework for tractable query answering over ontologies
Calì, A., Gottlob, G., & Lukasiewicz, T. (2012) · Journal of Web Semantics · doi:10.1016/j.websem.2012.03.001 · Cited by 407
Metadata
- Authors
- Fagin, R., Kolaitis, P. G., Miller, R. J., & Popa, L.
- Affiliations
- IBM Research - Almaden (US)
- University of California, Santa Cruz (US)
- University of Toronto (CA)
- Corresponding author
- Popa, Lucian
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2005-05
- Volume
- 336
- Issue
- 1
- Pages
- 89-124
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2102729564
- Cited by
- 1,206
- References
- 40
- Citations by year
- 2026: 5 · 2025: 13 · 2024: 10 · 2023: 41 · 2022: 32 · 2021: 32 · 2020: 53 · 2019: 59 · 2018: 57 · 2017: 69 · 2016: 58 · 2015: 63 · 2014: 80 · 2013: 101 · 2012: 95
- FWCI
- 51.62
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 3035 d)
- Locations
- Theoretical Computer Science (publishedVersion)
- Funders
- National Science Foundation (9907419)
- Natural Sciences and Engineering Research Council of Canada
- Topics
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Keywords
- data exchange, query answering, universal solutions, algebraic specification, certain answers, canonical solutions, computational complexity, schema mapping
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.
