B. de Brock. Foundations of Semantic Databases. Prentice Hall, New York, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Semantic Integrity Support in SQL-99 and Commercial.. - Türker, Gertz (2000) (Correct)
....aspects. The results of the different research efforts are documented in hundreds of papers. Several dissertations, e.g. 12, 22, 29, 37, 58, 45, 44, 69] and chapters in textbooks, e.g. 70, 19, 23, 38, 63, 62] are devoted to semantic integrity issues in databases. There also are books like [47, 1, 21] that primarily focus on theoretical foundations of integrity constraints. Here we do not aim at recalling and commenting previous work in this area. For that, we particularly refer to the dissertations and textbooks cited above. The reader will find there a lot of references to interesting work ....
B. de Brock. Foundations of Semantic Databases. Prentice Hall, New York, 1995.
Transformational Design Of Digital systems based on graph rewriting - Huijs (1996) (1 citation) (Correct)
....as projection operator and the renaming operator . The use of the obtained table algebra in the definition of a formal semantics is informally illustrated by discussing the derivation of the observable behaviour of hypergraph Gnew in figure 7. A table is a set of functions with a common domain [11]. This common domain is called the heading of the table. If a table is used as representation of the behaviour of a hyperedge then the heading of the table consists of the nodes to which this hyperedge is connected. A table corresponds with a predicate on functions (specifying whether the ....
.... Table(add) a b c Table(add1) c e d 1 1 2 1 1 2 1 2 3 1 2 3 2 1 3 2 1 3 2 2 4 2 2 4 The behaviour of hypergraph GA is the composition of Table(add) and Table(add1) Table(GA) Table(add) Table(add1) a b c e d 1 1 2 1 3 1 1 2 2 4 The natural join , known from database theory [11], corresponds with the conjunction of predicates. The natural join combines function elements, rows, of tables into a function element, row, of a new table. Functions can only be combined if for shared domain elements the original functions deliver the same function value. In case of the natural ....
E.O. de Brock, Foundations of Semantic Databases, Prentice Hall, 1995.
A Methodology for the Design of Guaranteed Correct .. - Middelhoek.. (1996) (2 citations) (Correct)
....is shown how PVS can be used for transformation verification. 4.1 Design Representation and Behavior SIL graphs are used as design representations. A semantic function maps each graph onto a table representing the external behavior of this graph. The table concept is taken from database theory [Bro95] and can be seen as a generalization of truth tables. Truth tables are often used to specify functional behavior of logical components. Each row describes a combination of values allowed at the external ports. These rows can be defined mathematically as functions on the set of ports. A table then ....
....truth tables. Truth tables are often used to specify functional behavior of logical components. Each row describes a combination of values allowed at the external ports. These rows can be defined mathematically as functions on the set of ports. A table then is a set of functions on a common domain [Bro95]. This table concept is used to represent behavior. For example the behavior of an adder for integer values with external ports a, b, and c is given by: a b c add: Table(add) f [dom(f) a, b, c ] f(a) f(b) f(c) INT] f(c) f(a) f(b) In case the allowed input values are ....
[Article contains additional citation context not shown here]
E.O. de Brock, Foundations of Semantic Databases, Prentice Hall, 1995.
A Graph Rewriting Approach for Transformational Design of Digital.. - Huijs (1996) (1 citation) (Correct)
....5.1 Table Algebra as attribute algebra The behaviour specified by a graph is a data relation on its external nodes, its boundary. Tables are defined as representations of relations and can be viewed as a generalisation of the truth table concept. A table is a set of functions with a common domain [22]. This common domain is called the heading of the table. If a table is used as representation of the behaviour of a hyperedge then the heading of the table consists of the nodes to which this hyperedge is connected. A table corresponds with a predicate on functions (specifying if the function ....
E.O. de Brock, Foundations of Semantic Databases, Prentice Hall, 1995
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC