Reasoning in data integration systems: why LAV and GAV are siblings

Calì, Andrea (2003) Reasoning in data integration systems: why LAV and GAV are siblings. In: Zhong, N. and Ras, Z.W. and Tsumoto, S. and Suzuki, E. (eds.) Foundations of Intelligent Systems: 14th International Symposium. Lecture Notes in Computer Science 2871. Springer, pp. 562-571. ISBN 9783540202561.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/978-3-540-39592-8\_79

Abstract

Data integration consists in providing a uniform access to a set of data sources, through a unified representation of the data called global schema; a mapping specifies the relationship between the global schema and the sources. Integrity constraints (ICs) are expressed on the global schema to better represent the domain of interest; in general, ICs are not satisfied by the data at the sources. In this paper we address the problem of query answering in GLAV data integration systems, where tuple-generating dependencies are expressed on the global schema. We solve the problem in an intensional fashion, by presenting a rewriting technique that, taking into account both the ICs and the mapping, allows us to compute the answers to a query, expressed over the global schema, by evaluating the rewritten query directly over the sources. Since the GLAV approach is a generalisation of the basic approaches LAV and GAV, we show that query answering under ICs can be done in the same way in LAV and GAV systems, thus proving that LAV and GAV are siblings, and not opposites.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	02 Feb 2021 18:21
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/42860

Statistics

Archive Staff Only (login required)

Edit/View Item