J.H. ter Bekke and J.A. Bakker (Netherlands)
Query language, recursive query processing, semantic data modeling, metadata, end user computing, reachability, transitive closure, expressive power.
As shown in the introductory paper [7], the semantic modeling approach enables us to specify relationships in an inherent way. Consequently, designers can specify recursive structures in a way complying with the recursive mathematical definition of a series of variables. For end users this has the advantage that they can ignore procedural aspects in query specifications for recursion; the required processing details are derived by intelligent software able to interpret the underlying inherently structured metadata, which results in a reliable (finite) and efficient processing. We demonstrate this by examples of recursive and non-recursive queries using a recursive data model for family trees, which is implemented in a working database management system.
Important Links:
Go Back
