P. Kanellakis. Constraint programming and database languages: A tutorial. In Proceedings of 14th ACM Symposium on Principles of Database Systems, San Jose, pages 46--53, May 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....includes [2, 8, 11] for a survey see [1] In recent years, various extensions of the basic relational model have been studied. Two most notable ones are extensions to complex objects, or nested relations [27] which underlie most object oriented datamodels, and extensions to constraint databases [19, 20], which are used as the basis for geographical and temporal datamodels. For nested relations most basic questions about expressive power and the structure of queries have been answered (see [27] and references therein) but only very recently has some progress been made for constraint databases. ....

P. Kanellakis. Constraint programming and database languages: A tutorial. In PODS'95, pages 46--53.

....addition, we prove a stronger result for stable structures; we show that any permutation invariant queries that are definable in a stable structure, are pure first order definable in the sense of finite model theory. One of the main motivations for the results here comes from constraint databases [20, 21], which are used as the basis for geographical and temporal datamodels. The framework of constraint databases assumes some underlying model M = hU; Omega i where U is an infinite set and Omega is a signature that consists of a number of interpreted functions and predicates over U. In the ....

P. Kanellakis. Constraint programming and database languages: A tutorial. In PODS'95, pages 46--53.

....testing whether a set of points forms a convex hull. So the coupling of relational calculus with arithmetic constraints enhances power. A natural question, which attracted much attention recently, arises: How much more power can we gain from this coupling In particular, several recent papers [17, 18, 16, 26, 11, 23] made and attempted to settle the following conjecture. Conjecture. Queries such as transitive closure, connectivity test, parity test are not definable in the relational calculus plus polynomial inequality constraints over the reals. These three queries are singled out because they involve two ....

P. Kanellakis. Constraint programming and database languages: A tutorial. In Proceedings of 14th ACM Symposium on Principles of Database Systems, San Jose Ca, pages 46--53, May 1995.

....four vertices of some diamond. Thus, the coupling of relational calculus with arithmetic constraints enhances power. A natural question arises, attracting much attention recently: How much more power can we gain from this coupling The following conjecture, discussed extensively in the literature [22, 20, 19, 30, 14, 26], has been open for several years. Conjecture. Queries such as transitive closure, connectivity test, and parity test are not definable in the relational calculus plus polynomial inequality constraints over the reals. These three queries are singled out because they involve two basic primitives, ....

P. Kanellakis. Constraint programming and database languages: A tutorial. In Proceedings of 14th ACM Symposium on Principles of Database Systems, San Jose, pages 46--53, May 1995.

.... 15 5 Related Work Many works deal with finite representations of infinite sets of databases, both in the constraint database literature [KKR90,vdM93] and in the literature on uncertain and indefinite databases [AKG91,Gra91,IL84,Men84] We will not go into details; for surveys of these fields see [Kan95] and [vdM98] The work of Motro [Mot97] is close in spirit and motivation to ours; however, Motro assumes the existence of a real world global database instead of modeling the uncertainty in the sources by associating a set of databases with them; this makes it difficult to give precise meaning ....

Kanellakis P. C. Constraint Programming and Database Languages: A Tutorial. Proc. 14th ACM Symp. on Principles of Database Systems, pp. 46--53.

....extensional database relations as quantifier free first order formulas. Constraint databases in the form of non ground facts have been used in constraint logic programming [9, 10, 19] for almost ten years. Constraint databases also generated much interest recently in the database community [11]. In the database framework of [12] it was argued that the closed form requirement for relational query languages should extend to constraint query languages. That is, constraint query languages should take as input constraint databases and give as output constraint databases that use the same ....

P.C. Kanellakis. Constraint Programming and Database Languages: A Tutorial. Proc. 14th ACM Symposium on Principles of Database Systems, 46--53, 1995.

....four vertices of some diamond. Thus, the coupling of relational calculus with arithmetic constraints enhances power. A natural question arises, attracting much attention recently: How much more power can we gain from this coupling The following conjecture, discussed extensively in the literature [23, 21, 20, 31, 16, 28], has been open for several years. Conjecture. Queries such as transitive closure, connectivity test, and parity test are not definable in the relational calculus plus polynomial inequality constraints over the reals. These three queries are singled out because they involve two basic primitives, ....

P. Kanellakis. Constraint programming and database languages: A tutorial. In Proceedings of 14th ACM Symposium on Principles of Database Systems, San Jose, pages 46--53, May 1995.

....firstorder formulas. Constraint databases in the form of nonground facts were used in constraint logic programming [Cohen 1990; Jaffar and Lassez 1987; Jaffar and Maher 1994; Van Hentenryck 1989] for almost ten years. Constraint databases are also increasingly adopted for database use [Kanellakis 1995]. In the database framework of [Kanellakis et al. 1990] it was argued that constraint query languages should take as input constraint databases and give as output other constraint databases that use the same type of constraints. This has been called the closed form evaluation requirement. There ....

....include efficient indexing of constraint tuples, integrity constraints, built in aggregate operators, user interfaces, concurrent access to data, security etc. Many of these problems have to be rethought in the context of constraint databases (see the surveys [Cohen 1990; Jaffar and Maher 1994; Kanellakis 1995; Kanellakis and Goldin 1994] The constraint database system DISCO [Byon and Revesz 1995] under development at the University of Nebraska implements the constraint query language Datalog Z ; P(Z a ) We plan to implement safe stratified Datalog : Z ; P(Z a ) presented in this paper in a ....

Kanellakis, P. 1995. Constraint Programming and Database Languages: A Tutorial. In ACM Symposium on Principles of Database Systems (1995).

....includes [2, 7, 10] for a survey see [1] In recent years, various extensions of the basic relational model have been studied. Two most notable ones are extensions to complex objects, or nested relations [27] which underlie most objectoriented datamodels, and extensions to constraint databases [18, 19], which are used as the basis for geographical and temporal datamodels. For the nested relations most basic questions about expressive power and the structure of queries have been answered (see [27] and references therein) but only very recently has some progress been made for constraint ....

P. Kanellakis. Constraint programming and database languages: A tutorial. In PODS'95, pages 46--53.

....using constraints. Constraint databases find numerous applications in spatial [BJM93, BK95, BLLM95, PVdBVG94, VGVG95] and temporal databases [Cho94] Generalizing aggregation operators to constraint databases has been identified as one of the most important open research issues in this area [KG94, Kan95]. Some aggregation operators like count are not applicable to infinite relations. On the other hand, new operators like area [AS91] or its generalization: n dimensional volume [GK94] occur there quite naturally. A query language resulting from adding aggregation to a constraint query calculus ....

P.C. Kanellakis. Constraint Programming and Database Languages: A Tutorial. In ACM Symposium on Principles of Database Systems, 1995.

....system for spatial information is adequate relative to a query language if it is closed under queries in the language. It turns out that constraint databases have this property for FO and for some extensions with recursion [KKR90] The proof uses quantifier elimination techniques. See [Kan95] for a survey of the area. Constraint databases provide an approximate representation for spatial regions, which is adequate for many purposes. Although they are finite representations, they are not traditional finite relational structures. Of course, they could be encoded as such, but this is ....

P.C. Kanellakis, Constraint programming and database languages: A tutorial, Proc. ACM Symp. on Principles of Database Systems, 1995, pp. 46--53.

No context found.

P. Kanellakis. Constraint programming and database languages: A tutorial. In Proceedings of 14th ACM Symposium on Principles of Database Systems, San Jose, pages 46--53, May 1995.

No context found.

P.C. Kanellakis. Constraint Programming and Database Languages: A Tutorial. ACM Symposium on Principles of Database Systems, 1995.

No context found.

P.C. Kanellakis. Constraint Programming and Database Languages: A Tutorial. In ACM Symposium on Principles of Database Systems, 1995.

No context found.

P. Kanellakis. Constraint programming and database languages: A tutorial. In Proceedings of 14th ACM Symposium on Principles of Database Systems, San Jose, pages 46--53, May 1995.

No context found.

P. C. Kanellakis, "Constraint Programming and Database Languages: A Tutorial", Proc. 14th ACM Symp. Principles of Database Sys., pp. 46-53, 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