Search engines, web crawling and web graph
Please reference Principles of searching algorithms used by search engines as you reflect on the learning standard, below.
Once we have a graph which describes the relationship between nodes, we can use that data to rank pages based on the number of links. PageRank works this way, but is much more complicated.
Of course, computers don't use a visual directed graph. They probably use an adjacency matrix to calculate related nodes and number of relations. Please watch this excellent video to better understand adjacency matrix. In the linked video, the commentator rightly critiques the big O running time of an adjacency matrix. However, for the purpose of this article and concept, you should understand how a computer might represent a graph.
Do you understand this?[edit]
From the IB: Students should be aware of the Page Rank algorithm and explain how it works.
Standards[edit]
These standards are used from the IB Computer Science Subject Guide[2]
- Explain that search engines and web crawling use the web graph to access information.
References[edit]
- ↑ http://www.flaticon.com/
- ↑ IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.