329 search results - page 41 / 66 » Efficient Parallel Query Processing by Graph Ranking |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance ...
WAW
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
DEXA
2004
Springer
14 years 24 days ago
2004
Springer
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we cast the image-ranking problem into the task of identifying "authority" nodes on an inferred visual similarity graph and propose an algorithm to analyz...