BinRank: Scaling Dynamic Authority-Based Search Using Materialized Subgraphs

Abstract

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… (More)
DOI: 10.1109/TKDE.2010.85

Topics

15 Figures and Tables

Cite this paper

@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={2009 IEEE 25th International Conference on Data Engineering}, year={2009}, pages={66-77} }