Scaling Dynamic Authority-Based Search Using Materialized Sub graphs

Scaling Dynamic Authority Based Search Using Materialized Subgraphs projects main idea is to develop a application which can accurately rank a webpage based on the content present in the site. This project works on basic factors like keywords, search algorithms and links provided in the site and recall high quality pages from search database. Algorithms used in this project are query time page. Developing these graphs will be expensive for large graphs which is not feasible at query time. Process including for quering  keywords requires huge preprocessing.

This project BinkRank works on hybrid approach which is inspired by considering materialized in regular query processing. This application works on small data graphs by using this graphs keywords can be answered by running object Rank on only one of the subgraphs.