13 search results - page 3 / 3 » Parameterized Complexity for the Database Theorist |
ICDT
2003
ACM
15 years 2 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
ER
1999
Springer
15 years 1 months ago
1999
Springer
We propose a method for modeling complex Web sources that have active user interaction requirements. Here active" refers to the fact that certain information in these sources ...
IS
2007
14 years 9 months ago
2007
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...