804 search results - page 34 / 161 » On the Termination of the Chase Algorithm |
97
Voted
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— In this work we consider the problem of pursuit evasion games (PEGs) where a group of pursuers is required to detect, chase and capture a group of evaders with the aid of a sen...
ICDT
2005
ACM
15 years 6 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...
116
click to vote
HPDC
2002
IEEE
15 years 5 months ago
2002
IEEE
One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effe...
129
click to vote
CAV
2008
Springer
15 years 2 months ago
2008
Springer
Termination of a heap-manipulating program generally depends on preconditions that express heap assumptions (i.e., assertions describing reachability, aliasing, separation and shar...