62 search results - page 1 / 13 » Query rewriting with symmetric constraints |
AICOM
2004
13 years 4 months ago
2004
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
ICDT
2005
ACM
13 years 10 months ago
2005
ACM
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
SIGMOD
1999
ACM
13 years 8 months ago
1999
ACM
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
PODS
2003
ACM
14 years 4 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
RR
2007
Springer
13 years 10 months ago
2007
Springer