Efficient Upper Bound Computation of Query Answers in Expressive Description Logics
Yujiao Zhou, Bernardo Cuenca Grau, Ian Horrocks · 2012
In recent years, there has been a growing interest in the problem of conjunctive query answering over description logic (DL) ontologies and large scale data sets. This problem is central to many applications, which often involve managing data sets consisting of hundreds of millions, or even billions of data assertions.