3368 search results - page 259 / 674 » The Complexity of Query Reliability |
160
click to vote
SIGIR
2005
ACM
16 years 5 days ago
2005
ACM
When applying blind relevance feedback for ad hoc document retrieval, is it possible to identify, a priori, the set of query terms that will most improve retrieval performance? Ca...
141
click to vote
CAISE
2005
Springer
16 years 4 days ago
2005
Springer
A challenging question is how XML can be used to support distributed databases. This leads to the problem of how to obtain a suitable, cost-efficient distribution design for XML do...
154
click to vote
VLDB
2005
ACM
16 years 2 days ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
184
click to vote
ICDT
2003
ACM
15 years 11 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
167
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...