Search: in, Diff, Theory

4 results

Results

Change detection in hierarchically structured information

... version and configuration management. Most previous work in change management has dealt with flat-file and relational data; we focus on hierarchically structured data. Since in many cases changes must be computed from old and new versions of the data, ...

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

Meaningful change detection in structured data

... databases, and version and configuration management. In this paper we focus on detecting meaningful changes in hierarchically structured data, such as nested-object data. This problem is ...

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

An O(ND) Difference Algorithm and Its Variations

... A into B have long been known to be dual problems. In this paper, they are shown to be equivalent to finding a shortest/longest path in an edit graph. Using this perspective, a simple O(ND) time and space ...

Publication - huliganka - 04/16/2013 - 23:16 - 0 comments - 1 attachment

On the Editing Distance between Undirected Acyclic Graphs and Related Problems

... form of the constrained distance previously reported in [27]. When applied to ordered trees, the degree-2 distance is a ... and insertions occur at leaves i.e., with degree 1.) In this extended abstract, we present algorithms for computing the degree-2 ...

Publication - huliganka - 04/16/2013 - 06:16 - 0 comments - 0 attachments