Abstract
The unstructured, heterogeneous and dynamic nature of the Web poses a new challenge to query-answering over multiple data sources. The so-called Semantic Web aims at providing more and semantically richer structures in terms of ontologies and meta-data. A problem that remains is the combined use of heterogeneous sources. In a dynamic environment, it is no longer realistic to assume that the involved data sources act as if they were a single (virtual) source, modelled as a global schema, as is done in classical data integration approaches. In this paper, we propose an alternative approach where we replace the role of a single virtual data source schema with a peer-to-peer approach relying on limited shared (or: overlapping) vocabularies between peers. Since overlaps between vocabularies of peers will be limited and the dynamic nature of the system prohibits the design of accurate mappings, query processing will have to be approximate. We provide a formal model for such approximate query processing based on limited shared vocabularies between peers, and we show how the quality of the approximation can be adjusted in a gradual manner. The result is a flexible architecture for query-processing in heterogenous and dynamic environments, based on a formal foundation. We present the approach and discuss it on the basis of a case study.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Bergamaschi, S. Castano, and M. Vincini. Semantic integration of semi-structured and structured data sources. SIGMOD Records, 28(1):54–59, March 1999.
P. Bernstein, F. Giunchiglia, A. Kementsietsidis, J. Mylopoulos, L. Serafini, and I. Zaihrayeu. Data management for peer-to-peer computing: A vision. Technical Report DIT-02-0013, Depertment of Information Technologies, University of Trento, 2002. Also appears in Proceedings of Web DB 2002.
D. Calvanesea, G. De Giacomo, and M. Lenzerini. Description logics for information integration. In Computational Logic: From Logic Programming into the Future, Lecture Notes in Computer Science. Springer Verlag, 2001.
F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In G. Brewka, editor, Principles of Knowledge Representation, Studies in Logic, Language and Information, pages 193–238. CSLI Publications, 1996.
F. Giunchiglia and I. Zaihrayeu. Making peer databases interact — a vision for an architecture supporting data coordination. In CIA 2002: Cooperative Information Agents, Lecture Notes in AI. Springer, 2002.
A. Gomez-Perez and O. Corcho. Ontology langauges for the semantic web. IEEE Intelligent Systems, January/February:54–60, 2002.
A. Y. Halevy. Answering queries using views: A survey. The VLDB Journal, 10(4):270–294, 2001.
I. Horrocks. The FaCT system. In H. de Swart, editor, Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux’98, number 1397 in Lecture Notes in Artificial Intelligence, pages 307–312. Springer-Verlag, Berlin, May 1998.
I. Horrocks and S. Tessaris. A conjunctive query language for description logic aboxes. In AAAI/IAAI, pages 399–404, 2000.
M. Lenzerini. Data integration: A theoretical perspective. In PODS, pages 233–246, 2002.
J. Madhavan, P. Bernstein, P. Domingos, and A. Halevy. Representing and reasoning about mappings between domain models. In Eighteenth National Conference on Artificial Intelligence (AAAI’2002), Edmonton, Canada, 2002.
M. Parameswaran, A. Sursala, and A. Winston. P2p networking: An information sharing alternative. IEEE Computing, 34(7), 2001.
M. Peim, E. Franconi, and N. Paton. Estimating the quality of answers when querying description logic ontologies. Data and Knowledge Engineering, 2002. (submitted).
E. Rahm and P. A. Bernstein. A survey of approaches to automatic schema matching. The VLDB Journal, 10(4):334–350, 2001.
B. Selman and H. Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193–224, March 1996.
H. Stuckenschmidt. Approximate information filtering with multiple classification hierarchies. International Journal of Computational Intelligence and Applications, 2002. to appear.
H. Stuckenschmidt. Ontology-Based Information Sharing in Weakly-Structured Environments. PhD thesis, Faculty of Sciences, Vrije Universiteit Amsterdam, 2002.
H. Stuckenschmidt, F. van Harmelen, and F. Giunchiglia. Query processing in ontology-based peer-to-peer systems. Technical report, Department of Department of Information and Communication Technology, University of Trento, November 2002.
H. Wache, T. Voegele, U. Visser, H. Stuckenschmidt, G. Schuster, H. Neumann, and S. Huebner. Ontology-based integration of information — a survey of existing approaches. In Ontologies and Information Sharing, number 47, pages 108–117, Seattle, USA, August 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Birkhäuser Verlag
About this paper
Cite this paper
Stuckenschmidt, H., van Harmelen, F., Giunchiglia, F. (2005). Query Processing in Ontology-Based Peer-to-Peer Systems. In: Tamma, V., Cranefield, S., Finin, T.W., Willmott, S. (eds) Ontologies for Agents: Theory and Experiences. Whitestein Series in Software Agent Technologies. Birkhäuser Basel. https://doi.org/10.1007/3-7643-7361-X_7
Download citation
DOI: https://doi.org/10.1007/3-7643-7361-X_7
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7237-8
Online ISBN: 978-3-7643-7361-0
eBook Packages: Computer ScienceComputer Science (R0)