115 search results - page 1 / 23 » Versioning Tree Structures by Path-Merging |
FAW
2008
Springer
13 years 10 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
KDID
2003
13 years 10 months ago
2003
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
ECCC
2010
13 years 7 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
ICDE
2002
IEEE
14 years 10 months ago
2002
IEEE
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
DAWAK
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...