Consistency and currency in functional databases

technical reportWe consider a hybrid model of databases, in which a functional component T is defined as an extension to an imperative component B. T. is loosely coupled to B through a highly parallel function network N. which provides a simple failsafe test of whether an existing assignment of values to a given view (subset) T' of T is consistent. If this test fails, or when a "current" view of T' is desired, N can be requested to "refresh" T' so that its values become consistent with respect to the current assignment to B. These requests are serviced by N without danger of system deadlock

Semantic definition of a subset of the structured query language (SQL)

Journal ArticleSQL is a relational database definition and manipulation language. Portions of the manipulation language are readily described in terms of relational algebra. The semantics of a subset of the SQL select statement is described. The select statement allows the user to query the database. The select statement is shown to be equivalent to a series of relational and set operations. The semantics are described in terms of abstract data types for relation schemes, tuples, and relations. Certain forms of the union or intersection of two select statements are shown to have equivalent single select statement forms