A. Brodsky and Y. Kornatzky, The LiricC language: Querying Constraint Objects, Proc. ACM SIGMOD Conf. on Management of Data, San-Jose, California, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Approximation-based Query Evaluation, Expensive.. - Alexander Brodsky And (1995) Self-citation (Brodsky) (Correct)
.... between constraints and sets of points they define in programming systems goes to constraint logic programming (e.g. JaL87] The MDS objects we study here are strongly related to, and contain as a subfamily, generalized relations in [KKR90] and CST objects using linear constraints over reals in [BK95] (that we used in the motivating example) 7.1 Constraint Formulae vs. Multidimensional Sets Although MDS objects represent infinite sets, they, clearly, must be finitely representable. The finite representation of MDS will be by constraints, expressed as logical formulae. More formally, ....
....: x n ) 2 S. It is important to realize that the small set of logical connectors and predicates of formulae above is highly expressive, and can for instance express intersection, union, containment, emptiness, disjointness, projections. Just in the specific case of linear constraints over reals [BK95] we can additionally express projections on axes, hyperplanes or subspace, translating from one coordinate system to another, augmenting, rotating, translating, stretching, permutating coordinates etc. The class of CF objects, being based on predicate logic, is too general for all the ....
[Article contains additional citation context not shown here]
A. Brodsky and Y. Kornatzky, The LiricC language: Querying Constraint Objects, Proc. ACM SIGMOD Conf. on Management of Data, San-Jose, California, 1995.
On Approximation-based Query Evaluation, Expensive.. - Alexander Brodsky And Self-citation (Brodsky) (Correct)
.... between constraints and sets of points they define in programming systems goes to constraint logic programming (e.g. JaL87] The MDS objects we study here are strongly related to, and contain as a subfamily, generalized relations in [KKR90] and CST objects using linear constraints over reals in [BK95] (that we used in the motivating example) 11 . 7.1 Constraint Formulae vs. Multidimensional Sets Although MDS objects represent infinite sets, they, clearly, must be finitely representable. The finite representation of MDS will be by constraints, expressed as logical formulae. More formally, ....
....: x n ) 2 S. It is important to realize that the small set of logical connectors and predicates of formulae above is highly expressive, and can for instance express intersection, union, containment, emptiness, disjointness, projections. Just in the specific case of linear constraints over reals [BK95] we can additionally express projections on axes, hyperplanes or subspace, translating from one coordinate system to another, augmenting, rotating, translating, stretching, permutating coordinates etc. The class of CF objects, being based on predicate logic, is too general for all the ....
[Article contains additional citation context not shown here]
A. Brodsky and Y. Kornatzky, The LiricC language: Querying Constraint Objects, Proc. ACM SIGMOD Conf. on Management of Data, San-Jose, California, 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