In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...
Change computation is an essential component in several capabilities of a deductive database,such as integrity constraints checking, materialized view maintenanceandcondition moni...
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
In this paper, we present a query translation algorithm which allows object-oriented queries to be automatically translated into a relational query language. Our goal is to provid...
Daniel A. Keim, Hans-Peter Kriegel, Andreas Mieths...