779 search results - page 58 / 156 » Determining Time of Queries for Re-ranking Search Results |
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, ...
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
Users of the World-Wide Web are not only confronted by an immense overabundance of information, but also by a plethora of tools for searching for the web pages that suit their inf...
PVLDB
2011
13 years 2 months ago
2011
Studies find that at least 20% of web queries have local intent; and the fraction of queries with local intent that originate from mobile properties may be twice as high. The eme...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...