Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
A space and time efficient algorithm for SimRank computation
World Wide Web
SympGraph: a framework for mining clinical notes through symptom relation graphs
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Incremental and accuracy-aware personalized pagerank through scheduled approximation
Proceedings of the VLDB Endowment
A recommendation framework for remote sensing images by spatial relation analysis
Journal of Systems and Software
| Hi-index | 0.00 |
Personalized page rank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient batch algorithms exist for static whole-graph page rank, interactive query-time personalized page rank has proved more challenging. Here we describe how to select and build indices for a popular class of page rank algorithms, so as to provide real-time personalized page rank and smoothly trade off between index size, preprocessing time, and query speed. We achieve this by developing a precise, yet efficiently estimated performance model for personalized page rank query execution. We use this model in conjunction with a query workload in a cost-benefit type index optimizer. On millions of queries from CiteSeer and its data graphs with 74-320 thousand nodes, our algorithm runs 50-400 x faster than whole-graph page rank, the gap growing with graph size. Index size is 10-20% of a text index. Ranking accuracy is above 94%.