Andreas Nakkerud

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1