Incremental SPARQL Query Processing
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.
KeywordsSemantic Web Linked Open Data Sources query reformulation query rewriting ontology mapping
- 1.Euzenat, J.: Semantic precision and recall for ontology alignment evaluation. In: Proc. 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 348–353 (2007)Google Scholar
- 2.Herzig, D., Tran, T.: One query to bind them all. In: COLD 2011, CEUR Workshop Proceedings, vol. 782 (2011)Google Scholar
- 7.Salton, G.: Automatic Text Processing: The Transformation, Analysis, and Retrieval of. Addison-Wesley (1989)Google Scholar
- 8.Schwarte, A., Haase, P., Hose, K., Schenkel, R., Schmidt, M.: Fedx: Optimization techniques for federated query processing on linked data. In: Aroyo, L., Welty, C., Alani, H., Taylor, J., Bernstein, A., Kagal, L., Noy, N., Blomqvist, E. (eds.) ISWC 2011, Part I. LNCS, vol. 7031, pp. 601–616. Springer, Heidelberg (2011)CrossRefGoogle Scholar
- 9.Van Rijsbergen, C.J.: Information Retrieval. Evaluation, http://www.dcs.gla.ac.uk/Keith/Chapter.7/Ch.7.html