FedSearch: Efficiently combining structured queries and full-text search in a SPARQL federation

24Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

Abstract

Combining structured queries with full-text search provides a powerful means to access distributed linked data. However, executing hybrid search queries in a federation of multiple data sources presents a number of challenges due to data source heterogeneity and lack of statistical data about keyword selectivity. To address these challenges, we present FedSearch - a novel hybrid query engine based on the SPARQL federation framework FedX. We extend the SPARQL algebra to incorporate keyword search clauses as first-class citizens and apply novel optimization techniques to improve the query processing efficiency while maintaining a meaningful ranking of results. By performing on-the-fly adaptation of the query execution plan and intelligent grouping of query clauses, we are able to reduce significantly the communication costs making our approach suitable for top-k hybrid search across multiple data sources. In experiments we demonstrate that our optimization techniques can lead to a substantial performance improvement, reducing the execution time of hybrid queries by more than an order of magnitude. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Nikolov, A., Schwarte, A., & Hütter, C. (2013). FedSearch: Efficiently combining structured queries and full-text search in a SPARQL federation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8218 LNCS, pp. 427–443). https://doi.org/10.1007/978-3-642-41335-3_27

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