Torre-Bastida, Ana I.Bermúdez, JesúsIllarramendi, ArantzaMena, EduardoGonzález, Marta2024-07-242024-07-242013Torre-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_2conference97836424076800302-9743https://hdl.handle.net/11556/2127Nowadays, 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.12enginfo:eu-repo/semantics/restrictedAccessconference output10.1007/978-3-642-40769-7_2Linked Open Data Sourcesquery rewritingSemantic WebSPARQL queryvocabulary mappingTheoretical Computer ScienceGeneral Computer Sciencehttp://www.scopus.com/inward/record.url?scp=84884963332&partnerID=8YFLogxK