A segmentation-based approach for approximate query over distributed ontologies

0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the popularity of semantic information systems distributed on the Web, there is an arising challenge to provide efficient query answering support for these systems. However, common approaches for distributed query answering either exhibit performance disadvantages or loss of completeness in an unbalanced way. In this paper, we introduce a novel approach for segment-based conjunctive query answering over distributed ontologies. Our approach balances the trade-off between performance and completeness by introducing segmentation-based distributed ontology integration. We define the notions of segment and approximate conjunctive query answering. Corresponding algorithms are designed, implemented and evaluated. The evaluation results show that our approach is very promising in processing ontologies in modern semantic information systems. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, Y., Qi, G., & Chen, M. (2008). A segmentation-based approach for approximate query over distributed ontologies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5367 LNCS, pp. 464–478). https://doi.org/10.1007/978-3-540-89704-0_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free