Sciweavers

179 search results - page 8 / 36
» Fixed-Point Query Languages for Linear Constraint Databases
Sort
View
SIGMOD
2012
ACM
224views Database» more  SIGMOD 2012»
11 years 10 months ago
Tiresias: the database oracle for how-to queries
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
Alexandra Meliou, Dan Suciu
PODS
2007
ACM
107views Database» more  PODS 2007»
14 years 7 months ago
Polynomial time fragments of XPath with variables
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot...
PODS
1999
ACM
151views Database» more  PODS 1999»
13 years 12 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
SDB
1995
178views Database» more  SDB 1995»
13 years 11 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
SEMWEB
2004
Springer
14 years 29 days ago
Querying Faceted Databases
Faceted classification allows one to model applications with complex classification hierarchies using orthogonal dimensions. Recent work has examined the use of faceted classi...
Kenneth A. Ross, Angel Janevski