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-citation
Cited by
Items 201–300 of 1,001
Fan, W., & Lü, P. (2017) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3034786.3056114 · Cited by 38
Scaling-up in-memory datalog processing: observations and techniques
Fan, Z., Zhu, J.-Q., Zhang, Z., Albarghouthi, A., Koutris, P., & Patel, J. M. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3311880.3311886 · Cited by 38
New Expressive Languages for Ontological Query Answering
Calì, A., Gottlob, G., & Pieris, A. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7957 · Cited by 37
Incrementally improving dataspaces based on user feedback
Belhajjame, K., Paton, N. W., Embury, S. M., Fernandes, A. A. A., & Hedeler, C. (2013) · Information Systems · doi:10.1016/j.is.2013.01.006 · Cited by 37
Ontological Query Answering with Existential Rules
Mugnier, M.-L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23580-1_2 · Cited by 37
From semantic integration to semantics management: case studies and a way forward
Rosenthal, A. S., Seligman, L., & Renner, S. A. (2004) · ACM SIGMOD Record · doi:10.1145/1041410.1041418 · Cited by 37
Certain conjunctive query answering in first-order logic
Wijsen, J. (2012) · ACM Transactions on Database Systems · doi:10.1145/2188349.2188351 · Cited by 37
Reverse data exchange: coping with nulls
Fagin, R., Kolaitis, P. G., Popa, L. C., & Tan, W.-C. (2009) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1559795.1559800 · Cited by 37
Self-citationComposition and inversion of schema mappings
Arenas, M., Pérez, J. E. P., Reutter, J. L., & Riveros, C. (2010) · ACM SIGMOD Record · doi:10.1145/1815933.1815938 · Cited by 37
Data exchange with data-metadata translations
Hernández, M. A., Papotti, P., & Tan, W.-C. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453888 · Cited by 37
Structural characterizations of schema-mapping languages
ten Cate, B., & Kolaitis, P. G. (2009) · Communications of the ACM · doi:10.1145/1629175.1629201 · Cited by 37
Self-citationGeneric schema mappings for composition and query answering
Kensche, D., Quix, C., Li, X., Li, Y., & Jarke, M. (2009) · Data & Knowledge Engineering · doi:10.1016/j.datak.2009.02.006 · Cited by 37
Fagin, R. (2006) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1142351.1142359 · Cited by 37
Self-citationDemartini, G., Enchev, I., Gapany, J., & Cudré-Mauroux, P. (2013) · Semantic Web · doi:10.3233/sw-2012-0064 · Cited by 36
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
Belhajjame, K., Paton, N. W., Embury, S. M., Fernandes, A. A. A., & Hedeler, C. (2010) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1739041.1739110 · Cited by 36
Guarded-Based Disjunctive Tuple-Generating Dependencies
Bourhis, P., Manna, M., Morak, M., & Pieris, A. (2016) · ACM Transactions on Database Systems · doi:10.1145/2976736 · Cited by 36
Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation
Benedikt, M., Leblay, J., ten Cate, B., & Tsamoura, E. (2016) · Synthesis lectures on data management · doi:10.2200/s00703ed1v01y201602dtm043 · Cited by 36
Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
Botoeva, E., Konev, B. Y., Lutz, C., Ryzhikov, V., Wolter, F., & Zakharyaschev, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-49493-7_2 · Cited by 36
Stratification criteria and rewriting techniques for checking chase termination
Greco, S., Spezzano, F., & Trubitsyna, I. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402750 · Cited by 36
Conjunctive Query Containment under Access Limitations
Calì, A., & Martinenghi, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87877-3_24 · Cited by 36
Automatic Verification of Database-Centric Systems
Deutsch, A., Hull, R. B., & Vianu, V. (2014) · ACM SIGMOD Record · doi:10.1145/2694428.2694430 · Cited by 35
Chase termination: a constraints rewriting approach
Greco, S., & Spezzano, F. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920858 · Cited by 35
HIL: a high-level scripting language for entity integration
Hernández, M. A., Koutrika, G., Krishnamurthy, R., Popa, L. C., & Wisnesky, R. J. (2013) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/2452376.2452440 · Cited by 35
Self-citationDou, K., Guo, B., & Kuang, L. (2017) · Multimedia Tools and Applications · doi:10.1007/s11042-017-4352-3 · Cited by 35
Mapping-driven XML transformation
Jiang, H., Ho, H., Popa, L. C., & Han, W.-S. (2007) · International World Wide Web Conference (WWW) · doi:10.1145/1242572.1242715 · Cited by 35
Self-citationOn the data complexity of consistent query answering
ten Cate, B., Fontaine, G., & Kolaitis, P. G. (2012) · International Conference on Database Theory · doi:10.1145/2274576.2274580 · Cited by 34
Self-citationA Declarative Framework for Linking Entities
Burdick, D., Fagin, R., Kolaitis, P. G., Popa, L. C., & Tan, W.-C. (2016) · ACM Transactions on Database Systems · doi:10.1145/2894748 · Cited by 34
Self-citationBenchmarking Ontology-Based Query Rewriting Systems
Imprialou, M., Stoilos, G., & Grau, B. C. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8215 · Cited by 34
Foundations of schema mapping management
Arenas, M., Pérez, J. E. P., Reutter, J. L., & Riveros, C. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807116 · Cited by 34
Declarative Probabilistic Programming with Datalog
Bárány, V., ten Cate, B., Kimelfeld, B., Olteanu, D., & Vagena, Z. (2017) · ACM Transactions on Database Systems · doi:10.1145/3132700 · Cited by 34
Query processing under GLAV mappings for relational and graph databases
Calvanese, D., Giacomo, G. D., Maurizio Lenzerini, B., & Vardi, M. Y. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2535568.2448940 · Cited by 33
Bikakis, N., Tsinaraki, C., Stavrakantonakis, I., Gioldasis, N., & Christodoulakis, S. (2014) · World Wide Web · doi:10.1007/s11280-013-0257-x · Cited by 33
Quasi-inverses of schema mappings
Fagin, R., Kolaitis, P. G., Popa, L. C., & Tan, W.-C. (2007) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1265530.1265548 · Cited by 33
Self-citationIncomplete information and certain answers in general data models
Libkin, L. O. (2011) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1989284.1989294 · Cited by 32
Calvanese, D., Giacomo, G. D., Lembo, D., Maurizio Lenzerini, B., Rosati, R., & Ruzzi, M. (2009) · Springer eBooks · doi:10.1007/978-3-642-04329-1_17 · Cited by 32
Modeling data for business processes
Sun, Y., Su, J., Wu, B., & Yang, J. Y. (2014) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2014.6816722 · Cited by 31
Ontological query answering under expressive Entity–Relationship schemata
Calì, A., Gottlob, G., & Pieris, A. (2011) · Information Systems · doi:10.1016/j.is.2011.09.006 · Cited by 31
A Graph-Based Approach to Learn Semantic Descriptions of Data Sources
Taheriyan, M., Knoblock, C. A., Szekely, P. A., & Ambite, J. L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41335-3_38 · Cited by 31
Composition with target constraints
Arenas, M., Fagin, R., & Nash, A. (2010) · International Conference on Database Theory · doi:10.1145/1804669.1804687 · Cited by 31
Self-citationThe Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules.
Bourhis, P., Morak, M., & Pieris, A. (2013) · Cited by 31
Data and Information Quality Research: Its Evolution and Future
Zhu, H., Madnick, S., Lee, Y. W., & Wang, R. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b16768-20 · Cited by 31
Data migration using datalog program synthesis
Wang, Y., Shah, R., Criswell, A., Pan, R., & Dillig, I. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3384345.3384350 · Cited by 31
Optimizing query answering under ontological constraints
Orsi, G., & Pieris, A. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402737 · Cited by 31
TRAMP: understanding the behavior of schema mappings through provenance
Glavic, B., Alonso, G., Miller, R. J., & Haas, L. M. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1921003 · Cited by 31
Self-citationNormalization and optimization of schema mappings
Gottlob, G., Pichler, R., & Savenkov, V. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687751 · Cited by 31
The Harmony Integration Workbench
Peter Mork, B., Seligman, L., Rosenthal, A. S., Korb, J., & Wolf, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92148-6_3 · Cited by 31
Towards Rule-Based Minimization of RDF Graphs under Constraints
Meier, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88737-9_8 · Cited by 31
A Distributed Algorithm for Robust Data Sharing and Updates in P2P Database Networks
Franconi, E., Kuper, G. M., Lopatenko, A., & Zaihrayeu, I. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30192-9_44 · Cited by 31
Köehler, H., Link, S., & Zhou, X. (2015) · ResearchSpace (University of Auckland) · doi:10.5555/2809974.2809975 · Cited by 31
Chase Termination for Guarded Existential Rules
Calautti, M., Gottlob, G., & Pieris, A. (2015) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/2745754.2745773 · Cited by 30
Explanations for Negative Query Answers under Existential Rules
Ceylan, İ. İ., Lukasiewicz, T., Malizia, E., Molinaro, C., & Vaicenavičius, A. (2020) · Principles of Knowledge Representation and Reasoning · doi:10.24963/kr.2020/23 · Cited by 30
Data exchange beyond complete data
Arenas, M., Pérez, J. E. P., & Reutter, J. L. (2013) · Journal of the ACM · doi:10.1145/2508028.2505985 · Cited by 30
SchizConnect: Virtual Data Integration in Neuroimaging
Ambite, J. L., Tallis, M., Alpert, K. I., Keator, D. B., King, M. D., Landis, D., Konstantinidis, G., Calhoun, V. D., Potkin, S. G., Turner, J. A., et al. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21843-4_4 · Cited by 30
Containment of conjunctive object meta-queries
Calì, A., & Kifer, M. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164208 · Cited by 30
Collaborative Business Intelligence
Rizzi, S. (2012) · Lecture notes in business information processing · doi:10.1007/978-3-642-27358-2_9 · Cited by 30
Characterizing schema mappings via data examples
Alexe, B., Kolaitis, P. G., & Tan, W.-C. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807120 · Cited by 29
Self-citationXML mapping technology: Making connections in an XML-centric world
Roth, M., Hernández, M. A., Coulthard, P., Yan, L., Popa, L., Ho, H. C.-T., & Salter, C. C. (2006) · IBM Systems Journal · doi:10.1147/sj.452.0389 · Cited by 29
Self-citationDisjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
Alviano, M., Faber, W., Leone, N., & Manna, M. (2012) · Theory and Practice of Logic Programming · doi:10.1017/s1471068412000257 · Cited by 29
Inverting schema mappings: bridging the gap between theory and practice
Arenas, M., Pérez, J., Reutter, J. L., & Riveros, C. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687742 · Cited by 29
Data exchange in the presence of arithmetic comparisons
Afrati, F., Li, C., & Pavlaki, V. (2008) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1353343.1353403 · Cited by 29
Horizontal Fragmentation for Data Outsourcing with Formula-Based Confidentiality Constraints
Wiese, L. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16825-3_8 · Cited by 28
Extending Acyclicity Notions for Existential Rules
Baget, J.-F., Garreau, F., Mugnier, M.-L., & Rocher, S. (2014) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-419-0-39 · Cited by 28
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/–
Lukasiewicz, T., Martínez, M. V., & Simari, G. I. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41030-7_35 · Cited by 28
Active Learning of GAV Schema Mappings
ten Cate, B., Kolaitis, P. G., Qian, K., & Tan, W.-C. (2018) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3196959.3196974 · Cited by 28
Self-citationLearning Semantic Models of Data Sources Using Probabilistic Graphical Models
Vũ, B. D., Knoblock, C. A., & Pujara, J. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308558.3313711 · Cited by 28
Straccia, U., & Raphaël Troncy, A. (2006) · Lecture notes in computer science · doi:10.1007/11762256_29 · Cited by 28
ten Cate, B., Dalmau, V., & Kolaitis, P. G. (2012) · International Conference on Database Theory · doi:10.1145/2274576.2274596 · Cited by 27
Self-citationComputing stable models for nonmonotonic existential rules
Magka, D., Krötzsch, M., & Horrocks, I. R. (2013) · Cited by 27
A Collective, Probabilistic Approach to Schema Mapping
Kimmig, A., Memory, A., Miller, R. J., & Getoor, L. C. (2017) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2017.140 · Cited by 27
Self-citationDatalog Extensions for Tractable Query Answering over Ontologies
Calì, A., Gottlob, G., & Lukasiewicz, T. (2009) · Springer eBooks · doi:10.1007/978-3-642-04329-1_12 · Cited by 27
Fagin, R., Kimelfeld, B., & Kolaitis, P. G. (2011) · Journal of the ACM · doi:10.1145/1989727.1989729 · Cited by 27
Self-citationThe Product Homomorphism Problem and Applications
ten Cate, B., & Dalmau, V. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icdt.2015.161 · Cited by 27
Data Quality in Ontology-based Data Access: The Case of Consistency
Console, M., & Maurizio Lenzerini, B. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8871 · Cited by 27
Approximation Algorithms for Schema-Mapping Discovery from Data Examples
ten Cate, B., Kolaitis, P. G., Qian, K., & Tan, W. C. (2017) · ACM Transactions on Database Systems · doi:10.1145/3044712 · Cited by 27
Self-citationFoundations of Query Answering on Inconsistent Databases
Wijsen, J. (2019) · ACM SIGMOD Record · doi:10.1145/3377391.3377393 · Cited by 27
Privacy in GLAV Information Integration
Nash, A., & Deutsch, A. (2006) · Lecture notes in computer science · doi:10.1007/11965893_7 · Cited by 27
On the Complexity of Ontological Reasoning under Disjunctive Existential Rules
Gottlob, G., Manna, M., Morak, M., & Pieris, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32589-2_1 · Cited by 26
Generating SPARQL executable mappings to integrate ontologies
Rivero, C. R., Hernández, I., Ruiz, D., & Corchuelo, R. (2011) · International Conference on Conceptual Modeling · doi:10.5555/2075144.2075158 · Cited by 26
Mapping Analysis in Ontology-Based Data Access: Algorithms and Complexity
Lembo, D., Mora, J. F., Rosati, R., Savo, D. F., & Thorstensen, E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-25007-6_13 · Cited by 26
Interactive Mapping Specification with Exemplar Tuples
Bonifati, A., Comignani, U., Coquery, E., & Thion, R. (2017) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3035918.3064028 · Cited by 26
Characterisations of multivalued dependency implication over undetermined universes
Link, S. (2011) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2011.12.012 · Cited by 26
Kostylev, E. V., Reutter, J. L., & Ugarte, M. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icdt.2015.212 · Cited by 26
Stoffel, K., & Studer, T. (2005) · Lecture notes in computer science · doi:10.1007/11546924_32 · Cited by 26
A generic querying algorithm for greedy sets of existential rules
Thomazo, M., Baget, J.-F., Mugnier, M.-L., & Rudolph, S. (2012) · HAL · Cited by 26
Acyclicity conditions and their application to query answering in description logics
Grau, B. C., Horrocks, I. R., Krötzsch, M., Kupke, C., Magka, D., Motik, B., & Wang, Z. (2012) · Cited by 25
When data dependencies over SQL tables meet the logics of paradox and S-3
Hartmann, S., & Link, S. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807126 · Cited by 25
Polynomial combined rewritings for existential rules
Gottlob, G., Manna, M., & Pieris, A. (2014) · Principles of Knowledge Representation and Reasoning · Cited by 25
Tractable Query Answering over Conceptual Schemata
Calì, A., Gottlob, G., & Pieris, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04840-1_15 · Cited by 25
Hernich, A., Libkin, L. O., & Schweikardt, N. (2011) · ACM Transactions on Database Systems · doi:10.1145/1966385.1966392 · Cited by 25
Access patterns and integrity constraints revisited
Bárány, V., Benedikt, M., & Bourhis, P. (2013) · International Conference on Database Theory · doi:10.1145/2448496.2448522 · Cited by 25
Certain answers for XML queries
David, C., Libkin, L. O., & Murlak, F. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807112 · Cited by 25
Subsumption and complementation as data fusion operators
Bleiholder, J., Szott, S., Herschel, M., Kaufer, F., & Naumann, F. (2010) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1739041.1739103 · Cited by 25
Ontology-Mediated Queries for Probabilistic Databases
Borgwardt, S., Ceylan, İ. İ., & Lukasiewicz, T. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10680 · Cited by 25
On the equivalence between FDs in XML and FDs in relations
Vincent, M. W., Liu, J., & Mohania, M. (2007) · Acta Informatica · doi:10.1007/s00236-007-0048-x · Cited by 25
The recovery of a schema mapping: bringing exchanged data back
Arenas, M., Pérez, J., & Riveros, C. (2008) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1376916.1376920 · Cited by 25
Towards Inconsistency Management in Data Integration Systems.
Fuxman, A. D., & Miller, R. J. (2003) · Cited by 25
Self-citationData exchange beyond complete data
Arenas, M., Pérez, J. E. P., & Reutter, J. L. (2011) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1989284.1989293 · Cited by 24
Semantic enrichment of data for AI applications
Özcan, F., Lei, C., Quamar, A., & Efthymiou, V. (2021) · Workshop on Data Management for End-to-End Machine Learning (DEEM) · doi:10.1145/3462462.3468881 · Cited by 24
Exchanging Description Logic Knowledge Bases
Arenas, M., Botoeva, E., Calvanese, D., Ryzhikov, V., & Sherkhonov, E. (2012) · UvA-DARE (University of Amsterdam) · Cited by 24
Schema AND Data: A Holistic Approach to Mapping, Resolution and Fusion in Information Integration
Haas, L. M., Hentschel, M., Kossmann, D., & Miller, R. J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04840-1_5 · Cited by 24
Self-citation
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.