Heuristics for Applying Cached OBDA Rewritings

Abstract

In OBDA systems, cached rewritings can be used to significantly shorten the process of finding rewritings of bigger queries. The main challenge in using cached rewritings is finding the optimal combination to apply, a problem which is NP-complete. In this paper, we present a way to calculate the value of a cached rewriting, and propose using this value to decide which cached rewritings to apply. The idea behind our technique is to estimate how much computation, in particular optimization, has gone into the rewriting. This can tell us something about which cached rewritings we should prioritise, and also when to cache a rewriting. In order to quantify optimization, we define a measure of UCQs, and calculate this measure at different stages of the rewriting.

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Nakkerud2015HeuristicsFA, title={Heuristics for Applying Cached OBDA Rewritings}, author={Andreas Nakkerud and Evgenij Thorstensen}, booktitle={Description Logics}, year={2015} }