Post

We have a new release (v0.71.0) that substantially improves automated migration discovery by updating schema morphism search from enumeration and ranking to exact optimization.

github.comRelease v0.71.0 · panproto/panprotoAdded panproto_schema::induce and induce_on_vertices (panproto-schema): the supported way to cut a sub-schema, accounting for all twenty-one Schema fields in their own key spaces and rebuilding th...

panproto

@panproto.dev

Given two schemas, automated migration discovery now builds a cost function network and minimizes its integer cost. The result includes a certificate stating whether optimality was proved and which solver ran.

19/8/26, 2:39 pm0 reposts0 likes

panproto

@panproto.dev

19 Aug

The network has one variable per source vertex. Its domain contains kind-compatible target vertices plus ⊥, which means the vertex is omitted from the span. Each choice has an integer cost. The solver returns the minimum-cost complete assignment without enumerating every candidate.

panproto

@panproto.dev

19 Aug

Four solvers are available: bucket elimination in the (min, plus) semiring; hybrid best-first search with EDAC*; the same search with a counting Hall propagator for injective maps; and weighted partitioning for maximum common induced sub-schemas.