Query rewriting for an incremental search in heterogeneous linked data sources

Simple item page
dc.contributor.authorTorre-Bastida, Ana I.
dc.contributor.authorBermúdez, Jesús
dc.contributor.authorIllarramendi, Arantza
dc.contributor.authorMena, Eduardo
dc.contributor.authorGonzález, Marta
dc.contributor.institutionHPA
dc.contributor.institutionSG
dc.date.accessioned2024-07-24T11:51:51Z
dc.date.available2024-07-24T11:51:51Z
dc.date.issued2013
dc.description.abstractNowadays, the number of linked data sources available on the Web is considerable. In this scenario, users are interested in frameworks that help them to query those heterogeneous data sources in a friendly way, so avoiding awareness of the technical details related to the heterogeneity and variety of data sources. With this aim, we present a system that implements an innovative query approach that obtains results to user queries in an incremental way. It sequentially accesses different datasets, expressed with possibly different vocabularies. Our approach enriches previous answers each time a different dataset is accessed. Mapping axioms between datasets are used for rewriting the original query and so obtaining new queries expressed with terms in the vocabularies of the target dataset. These rewritten queries may be semantically equivalent or they could result in a certain semantic loss; in this case, an estimation of the loss of information incurred is presented.en
dc.description.statusPeer reviewed
dc.format.extent12
dc.identifier.citationTorre-Bastida , A I , Bermúdez , J , Illarramendi , A , Mena , E & González , M 2013 , Query rewriting for an incremental search in heterogeneous linked data sources . in Flexible Query Answering Systems - 10th International Conference, FQAS 2013, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 8132 LNAI , pp. 13-24 , 10th International Conference on Flexible Query-Answering Systems, FQAS 2013 , Granada , Spain , 18/09/13 . https://doi.org/10.1007/978-3-642-40769-7_2
dc.identifier.citationconference
dc.identifier.doi10.1007/978-3-642-40769-7_2
dc.identifier.isbn9783642407680
dc.identifier.issn0302-9743
dc.identifier.urihttps://hdl.handle.net/11556/2127
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=84884963332&partnerID=8YFLogxK
dc.language.isoeng
dc.relation.ispartofFlexible Query Answering Systems - 10th International Conference, FQAS 2013, Proceedings
dc.relation.ispartofseriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subject.keywordsLinked Open Data Sources
dc.subject.keywordsquery rewriting
dc.subject.keywordsSemantic Web
dc.subject.keywordsSPARQL query
dc.subject.keywordsvocabulary mapping
dc.subject.keywordsTheoretical Computer Science
dc.subject.keywordsGeneral Computer Science
dc.titleQuery rewriting for an incremental search in heterogeneous linked data sourcesen
dc.typeconference output
Files