A. Jung and H. Puhlmann, Types, logic, and semantics for nested databases. In: Proc. of the Conference on Mathematical Foundations of Programming Semantics--95, Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Models of Approximation in Databases - Libkin (Correct)
....become elements of Employees. Taking into account that some entries can be nulls, we see that the new consistency condition says that every element of every set in the lower approximation is at least as informative as some element of the upper approximation. Such constructions are called snacks [29, 31, 19]. The reason for this name is that they were initially thought of not quite correctly, as we shall show as many sandwiches, hence snacks. The graphical representation of a snack with a two element L is given in Figure 1. The semantics of snacks is defined precisely as the semantics of ....
.... U 6= The family of all scones over A is denoted by PP 9 (A) Snacks are obtained from scones exactly as mixes are obtained from sandwiches: by using the assumption about keys, additional information is inferred. Thus, the consistency condition is similar to that of mixes. Definition 4 (cf. [29, 31, 19]. Given a poset hA; i, a snack over A is a pair (U; L) where U is a finite antichain, and L = fL 1 ; L k g is a family of finite nonempty antichains which is itself an antichain with respect to v ] A snack is required to satisfy the consistency condition: 8L 2 L 8l 2 L 9u 2 u : u l ....
[Article contains additional citation context not shown here]
A. Jung and H. Puhlmann, Types, logic, and semantics for nested databases. In: Proc. of the Conference on Mathematical Foundations of Programming Semantics--95, Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, 1995.
Semi-Structured Information: A Modal Logic Approach - Alechina (1997) (Correct)
....of scheme. A snack (Buneman) is an approximation of a standard relation; it is a pair fP; fS 1 ; Sn gg where P is a set of tuples which includes every tuple of the approximated relation, and each of S i includes at least one tuple from the approximated relation. In modal logical terms (see [8]) a snack corresponds to a formula of the form 2p V i 3s i . In the graph scheme approach links cannot be forced on a database, therefore expressing 3s i ( there is a link labelled s i ) is impossible. In the modal language which is used in this paper, instead of 2 and 3 there are modalities ....
A. Jung and H. Puhlmann. Types, logic, and semantics for nested databases. In M. Main and S. Brookes, editors, 11th Conference on Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B.V., 1995.
Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (1 citation) Self-citation (Jung) (Correct)
....auxiliary. This viewpoint has been developed in two areas recently, in database semantics and in measure theory. In the former one enriches a space of values (as in database theory) with partial elements so as to allow partial information and complicated types to be incorporated. See [BJO91, JP95, Puh95] for the current state of this approach. Much remains to be done in this field. The second application was developed almost single handedly by Abbas Edalat over the last few years [Eda95b, Eda95a] He showed that when a topological Hausdorff space is embedded as singleton sets in its ....
A. Jung and H. Puhlmann. Types, logic, and semantics for nested databases. In M. Main and S. Brookes, editors, 11th Conference on Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B.V., 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