Sciweavers

179 search results - page 14 / 36
» Fixed-Point Query Languages for Linear Constraint Databases
Sort
View
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 8 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
FOCS
2003
IEEE
14 years 28 days ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
ICDE
2009
IEEE
165views Database» more  ICDE 2009»
14 years 9 months ago
Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams
Many location-based services require rich and expressive query language support for filtering large amounts of information. In prominent location-based services thousands of conti...
Zhengdao Xu, Hans-Arno Jacobsen
APLAS
2011
ACM
12 years 7 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
DBPL
2001
Springer
115views Database» more  DBPL 2001»
14 years 4 days ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen