143 search results - page 6 / 29 » Query Order and the Polynomial Hierarchy |
PODS
2004
ACM
14 years 10 months ago
2004
ACM
d abstract) Michael Benedikt Bell Labs Jan Van den Bussche Limburgs Universitair Centrum Christof L?oding Lehrstuhl Informatik VII RWTH Aachen Thomas Wilke Institut f?ur Informatik...
FQAS
2009
Springer
14 years 4 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
JELIA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Often, decision making involves autonomous agents that are structured in a complex hierarchy, representing e.g. authority. Typically the agents share the same body of kno...
SEMWEB
2010
Springer
13 years 7 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
FOIKS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...