342 search results - page 15 / 69 » Conjunctive Queries over Trees |
WWW
2010
ACM
14 years 1 months ago
2010
ACM
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
ICDT
2001
ACM
14 years 6 days ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
WWW
2011
ACM
13 years 2 months ago
2011
ACM
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
DAWAK
2003
Springer
14 years 29 days ago
2003
Springer
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...