A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Partitioned multi-indexing
2012
Proceedings of the 21st international conference on World Wide Web - WWW '12
To answer search queries on a social network rich with usergenerated content, it is desirable to give a higher ranking to content that is closer to the individual issuing the query. Queries occur at nodes in the network, documents are also created by nodes in the same network, and the goal is to find the document that matches the query and is closest in network distance to the node issuing the query. In this paper, we present the "Partitioned Multi-Indexing" scheme, which provides an
doi:10.1145/2187836.2187891
dblp:conf/www/BahmaniG12
fatcat:divs47skjvbtzmyczn7pammcmu