Schema Evolution publication categorizer

... These operations allows us to describe changes in a semantically more meaningful way. Since this change detection problem is NP-hard, in this paper we present a heuristic change detection algorithm that yields close to “minimal” ... is based on transforming the change detection problem to a problem of computing a minimum-cost edge cover of a bipartite graph. We study ...

Publication - huliganka - 04/17/2013 - 00:38 - 0 comments - 1 attachment