Efficient semantic search over structured web data: A GPU approach

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

Abstract

Semantic search is an advanced topic in information retrieval which has attracted increasing attention in recent years. The growing availability of structured semantic data offers opportunities for semantic search engines, which can support more expressive queries able to address complex information needs. However, due to the fact that many new concepts (mined from the Web or learned through crowd-sourcing) are continuously integrated into knowledge bases, those search engines face the challenging performance issue of scalability. In this paper, we present a parallel method, termed gSparql, which utilizes the massive computation power of general-purpose GPUs to accelerate the performance of query processing and inference. Our method is based on the backward-chaining approach which makes inferences at query time. Experimental results show that gSparql outperforms the state-of-the-art algorithm and efficiently answers structured queries on large datasets.

Cite

CITATION STYLE

APA

Tran, H. N., Cambria, E., & Giang Do, H. (2018). Efficient semantic search over structured web data: A GPU approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10762 LNCS, pp. 549–562). Springer Verlag. https://doi.org/10.1007/978-3-319-77116-8_41

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