96 search results - page 8 / 20 » PTIME Queries Revisited |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Redundancy and minimization of queries are investigated in a well known fragment of XPath that includes child and descendant edges, branches, wildcards, and multiple output nodes....
AMW
2010
13 years 9 months ago
2010
Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certa...