S. Kreutzer. Fixed-point query languages for linear constraint databases. In PODS 2000, pages 116-125. ACM press, 2000. 15 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reachability and Connectivity Queries in Constraint.. - Benedikt, Grohe.. (1999) (5 citations) (Correct)
.... set) are in PTIME if the dimension is xed (see, e.g. 17] However, languages capturing complexity classes over constraint databases are scarce (natural languages exist for databases de nable with order constraints only [15] also, rather complicated languages were given for linear constraints [16, 21]) Besides, this approach can only work for those queries applied as top level operators (i.e. outputs cannot be reused by other queries) There exists extensive literature on rst order de nable topological properties of constraint databases [28, 22, 24, 33] and it is well known that ....
S. Kreutzer. Fixed-Point Query Languages for Linear Constraint Databases. In ACM Symp. on Principles of Database Systems, ACM Press, 2000, pages 116-125.
Linear Approximation of Semi-Algebraic Spatial Databases Using.. - Geerts (Correct)
....ne queries relying on recursion, suggests the extension of these query languages with a recursion mechanism. In this paper we consider the extension of rst order logic with transitive closure operators. Other attempts to introduce recursion mechanisms to rst order logics can be found in [9] and [15, 16]. A less traditional extension of FO which can express some recursive queries is the Path Logic [3] This logic is able to express recursive queries like the query which ask whether a database is connected, or whether two points are path connected, but the exact expressive power of this logic is ....
....and decoding between a linear spatial database and this nite representation are expressible in FO TCS, we may conclude the completeness of this logic on linear spatial databases. The use of this nite representation to obtain expressibility results for linear spatial database is ubiquitous [21, 9, 4, 15, 16]. We show that we can construct in FO TC, a linear spatial database (and hence also a nite representation) which is homeomorphic to a given semi algebraic spatial database input. We call this the linearization of a semi algebraic spatial database. We prove that this construction terminates on all ....
S. Kreutzer. Fixed-point query languages for linear constraint databases. In Proceedings of the 19th ACM Symposium on Principles of Database Systems, pages 116-125. ACM Press, 2000.
Constraint databases: A tutorial introduction - Van den Bussche (2000) (Correct)
....to extend FO towards those we cannot express (two recent papers in this direction not covered by the book are [5, 14] Adding recursion to constraint query languages. Here a major issue is termination of the recursion, given that universes and relations are now in nite. Two recent papers are [13, 19]. Just a few open research directions are: Concrete algorithms and implementations. The DEDALE system stands out in the linear constraint context. We need good implemented systems also for other universes. Play the constraint database game for other universes than the typical numeric ones, ....
S. Kreutzer. Fixed-point query languages for linear constraint databases. In 19th ACM Symposium on Principles of Database Systems, 2000, pages 116-125.
Query Languages for Constraint Databases: First-Order Logic.. - Kreutzer (2001) (1 citation) Self-citation (Kreutzer) (Correct)
No context found.
S. Kreutzer. Fixed-point query languages for linear constraint databases. In PODS 2000, pages 116-125. ACM press, 2000. 15
Query Languages for Constraint Databases: First-Order Logic.. - Kreutzer (2001) (1 citation) Self-citation (Kreutzer) (Correct)
....model, as it is neither closed nor decidable on this class of databases (see [KPSV96] Logics extending FO by xed point constructs can be found in [GK97] and [GK00] Decidability and closure of these languages was achieved by including some kind of stop condition for the xed point induction. In [Kre00], this problem has also been attacked resulting in a language extending FO by xed points over a nite set of regions in the input database. Besides queries based on recursion there are also other important queries that are not rst order de nable. In the context of linear databases a very ....
....and has Ptime data complexity. It is also shown that this language and PFOL, an extension of FO by restricted multiplication de ned by Vandeurzen, Gyssens, and Van Gucht [VGG98] have the same expressive power. As mentioned above, a language extending FO by recursion mechanisms has been de ned in [Kre00]. Although this language turns out to be rather expressive for boolean queries, it lacks the power to de ne broad classes of non boolean queries. In Section 4 we present two alternative approaches to de ne xed point logics on linear constraint databases. The rst approach extends the logic de ned ....
[Article contains additional citation context not shown here]
S. Kreutzer. Fixed-point query languages for linear constraint databases. In PODS 2000, pages 116-125. ACM press, 2000. 15
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