Sciweavers

179 search results - page 1 / 36
» Fixed-Point Query Languages for Linear Constraint Databases
Sort
View
PODS
2000
ACM
221views Database» more  PODS 2000»
13 years 9 months ago
Fixed-Point Query Languages for Linear Constraint Databases
Ï ÒØÖÓ Ù Ñ ÐÝ Ó ÕÙ ÖÝ Ð Ò Ù × ÓÖ Ð Ò Ö ÓÒ¹ ×ØÖ ÒØ Ø × × ÓÚ Ö Ø Ö Ð׺ Ì Ð Ò Ù × Ö ¬Ò ÓÚ Ö ØÛÓ¹×ÓÖØ ×ØÖÙ ØÙÖ ×...
Stephan Kreutzer
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 8 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
ICDE
2008
IEEE
142views Database» more  ICDE 2008»
14 years 5 months ago
An Inflationary Fixed Point Operator in XQuery
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
Loredana Afanasiev, Torsten Grust, Maarten Marx, J...
FLOPS
2008
Springer
13 years 6 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...
CSL
2009
Springer
13 years 8 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe