We solve a problem, stated in [CGP10], showing that Sticky Datalog, defined in the cited paper as an element of the Datalog\pm project, has the finite controllability property. In order to do that, we develop a technique, which we believe can have further applications, of approximating Chase(D, T), for a database instance D and some sets of tuple generating dependencies T, by an infinite sequence of finite structures, all of them being models of T.
|Title of host publication||LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Number of pages||10|
|Publication status||Published - 2012|