Think of it as a persistent DOM with versioning capabilities especially well suited for flash disks. Furthermore moving subtrees is allowed as well as copying nodes/subtrees from other resources. All XPath-axis and more are provided. Very soon, in a couple of days maybe we will provide temporal axis. Furthermore hashes for each node are efficiently generated (based on it's subtree) and persisted as well as the number of children and descendants of a node is. A diff-algorithm facilitates the import of differences between tree structures. A GUI which is currently revised supports a Visual Analytics approach for comparing tree-structures. A rudimentary XPath 2.0 engine currently will be replaced with a brackit.org binding to support XQuery 1.0 and the Update Facility. Work on incremental indexes also started. Saxon might be used (XSLT, XQuery 1.0, XPath 2.0) as well.<p>Sirix will be nothing without a community, thus try it :-) Furthermore I more than welcome further open source developers which are also eager to bring Sirix one step forward. As described, there's a bunch of work todo and I have even more ideas sticking in my head ;-)
Sirix - a versioned, treebased storage system in Java (free software) | Heykuki News