329 search results - page 26 / 66 » Efficient Parallel Query Processing by Graph Ranking |
SIGIR
2011
ACM
12 years 11 months ago
2011
ACM
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
SEMWEB
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a...
ACL
2010
13 years 6 months ago
2010
Is it possible to use sense inventories to improve Web search results diversity for one word queries? To answer this question, we focus on two broad-coverage lexical resources of ...
SIGIR
2002
ACM
13 years 8 months ago
2002
ACM
In this paper we present an evaluation of techniques that are designed to encourage web searchers to interact more with the results of a web search. Two specific techniques are ex...
DATESO
2010
13 years 6 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...