Incremental SPARQL query processing
No Thumbnail Available
Identifiers
Publication date
2013
Authors
Advisors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Citations
Export
Abstract
The number of linked data sources available on the Web is growing at a rapid rate. Moreover, users are showing an interest for any framework that allows them to obtain answers, for a formulated query, accessing heterogeneous data sources without the need of explicitly specifying the sources to answer the query. Our proposal focus on that interest and its goal is to build a system capable of answering to user queries in an incremental way. Each time a different data source is accessed the previous answer is eventually enriched. Brokering across the data sources is enabled by using source mapping relationships. User queries are rewritten using those mappings in order to obtain translations of the original query across data sources. Semantically equivalent translations are first looked for, but semantically approximated ones are generated if equivalence is not achieved. Well defined metrics are considered to estimate the information loss, if any.
Description
Type
Citation
Torre-Bastida , A I 2013 , Incremental SPARQL query processing . in The Semantic Web : Semantics and Big Data - 10th International Conference, ESWC 2013, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 7882 LNCS , Springer Verlag , pp. 712-716 , 10th International Conference on The Semantic Web: Semantics and Big Data, ESWC 2013 , Montpellier , France , 26/05/13 . https://doi.org/10.1007/978-3-642-38288-8_57
conference
conference