12 search results - page 2 / 3 » On Containment of Conjunctive Queries with Arithmetic Compar... |
PODS
2002
ACM
15 years 9 months ago
2002
ACM
We consider conjunctive queries with arithmetic comparisons over multiple continuous data streams. We specify an algorithm for determining whether or not a query can be evaluated ...
178
click to vote
VLDB
2003
ACM
15 years 10 months ago
2003
ACM
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
113
click to vote
PODS
2010
ACM
15 years 2 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
ADBIS
2009
Springer
14 years 7 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
ICDT
2005
ACM
15 years 3 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...