BinRank: Scaling Dynamic Authority-Based Search Using Materialized Subgraphs

@article{Hwang2009BinRankSD,
  title={BinRank: Scaling Dynamic Authority-Based Search Using Materialized Subgraphs},
  author={Heasoo Hwang and Andrey Balmin and Berthold Reinwald and Erik Nijkamp},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  year={2009},
  volume={22},
  pages={1176-1190}
}
Dynamic authority-based keyword search algorithms, such as ObjectRank and personalized PageRank, leverage semantic link information to provide high quality, high recall search in databases, and the Web. Conceptually, these algorithms require a query-time PageRank-style iterative computation over the full graph. This computation is too expensive for large graphs, and not feasible at query time. Alternatively, building an index of precomputed results for some or all keywords involves very… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS
13 Citations
14 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…