14. Interoperability

1. 14. Interoperability Database interoperability --- Is the problem of making the data and queries of one database system usable to the users of another database system. Requires that the data models used in them have the same data expressiveness. Data expressiveness --- Database written in the data model used in Δ1 can be translated into an equivalent database in the data model of Δ2

2. 14.1.1 Constraint and Extreme Point Data Models Each database in the rectangles data model and Worboys’ data model is equivalent to a constraint database with some suitable types of constraints. Theorem: Any rectangle relation R is equivalent to a constraint relation C with only inequalityconstraints between constants and variables.

3. House2

4. Theorem: Any Worboys relation W is equivalent to a constraint relation C with two spatial variables with linear constraints and one temporal variable with inequality constraints.

5. Example:

6. 14.1.2 Constraint and Parametric Extreme Point Data Models Theorem: Any parametric rectangle relation R with m-degree polynomial parametric functions of t is equivalent to a constraint relation C with inequality constraints in which the spatial variables are bound from above or below by m-degree polynomial functions of t and t is bounded from above and below by constants.

7. Bomb2

8. Theorem: Any parametric 2-spaghetti relation W with quotient of polynomial functions of t is equivalent to a constraint relation C with polynomial constraints over the variables x, y, and t such that for each instance of t all the constraints are linear.

9. Example: Net2

10. Theorem: Any periodic parametric 2-spaghetti relation with periodic parametric functions of t is equivalent to a constraint database relation with periodic constraints over the variables x, y, t such that for each instance of t all the constraints are linear.

11. Example: Tide2

12. 14.1.3 Parametric and Geometric Transformation Models Theorem: Let [ai, bi] for 1<=i<=d be any set of d intervals with ai < bi, Let R=(Пi=1d[Xi[, Xi]], [from, to]) be any normal form parametric rectangle. Let G=(Пi=1d[ai, bi], [from, to], f) be any normal form geometric transformation object where f is definable as the system of equations xi=gixi + hi where gi and hi are functions of t for 1<=i<=d. Then R and G are equivalent if:

13. Theorem: Any parametric 2-spaghetti relation W with m-degree polynomial functions of t is equivalent to a two-dimensional parametric affine transformation object relation G with m-degree polynomial functions of t and a polygonal reference object.

15. 14.1.4 Constraint and Geometric Transformation Models Theorem: Any d-dimensional parametric affine transformation object relation with m-degree polynomial function soft t can be represented as a (d+1) dimensional constraint relation with polynomial constraints

16. 14.2 Query Interoperability 14.2.1 Query interoperability via Query Translation Figure 14.4. 14.2.2 Query Interoperability via Data Translation Figure 14.5

17. Theorem: All the spatiotemporal models appearing in Figure 14.3 are closed under intersection, complement, union, join, projection, and selection with inequality constraints that contain spatiotemporal variables and constants.

18. 14.2.3 Query Interoperability via a common basisFigure 14.7 Precise data translation --- We can translate each of the spatiotemporal data models of Chapter 13 into a syntactically restricted type of constraint database. We can also easily compare the expressive power of several different data models by translating them to restricted types of constraint databases

19. Advantages of common basis Easy query translation --- Many spatiotemporal query languages contain numerous spatial operators and other special language features. Safety and complexity --- By knowing the allowed syntax of the constraints in the common basis, we can gain valuable information about the safety and computational complexity of queries.

20. 14.2.4 Intersection of Linear Parametric rectangles Theorem: Whether two d-dimensional linear parametric rectangles intersect can be checked in O(d) time.