861 search results - page 129 / 173 » Relational Completeness of Query Languages for Annotated Dat... |
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
The aim of this paper is to demonstrate Hermes, a robust framework capable of aiding a spatio-temporal database developer in modeling, constructing and querying a database with dyn...
102
click to vote
EDBT
2012
ACM
13 years 5 days ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
OOPSLA
2010
Springer
14 years 8 months ago
2010
Springer
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...