861 search results - page 49 / 173 » Relational Completeness of Query Languages for Annotated Dat... |
ICDT
2007
ACM
15 years 3 months ago
2007
ACM
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...
100
click to vote
CIDR
2011
14 years 1 months ago
2011
Amazon’s Mechanical Turk (“MTurk”) service allows users to post short tasks (“HITs”) that other users can receive a small amount of money for completing. Common tasks on...
PODS
2002
ACM
15 years 10 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
119
click to vote
IS
2008
14 years 9 months ago
2008
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...