Partitioned multi-indexing: bringing order to social search

  title={Partitioned multi-indexing: bringing order to social search},
  author={Bahman Bahmani and Ashish Goel},
To answer search queries on a social network rich with user-generated 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… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS


Publications citing this paper.
Showing 1-10 of 17 extracted citations


Publications referenced by this paper.
Showing 1-3 of 3 references

An algorithm for finding nearest neighbours in (approximately) constant average time

E. V. Ruiz
Pattern Recogn. Lett., • 1986
View 4 Excerpts
Highly Influenced

The choice of reference points in best-match file searching

M. Shapiro
Commun. ACM, • 1977
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…