• A relationship between a set of items such that, for any two items, the first is either ranked higher than, ranked lower than, or ranked equal to the second. In mathematics, this is known as a weak order or total preorder of objects. It is not necessarily a total order of objects because two different objects can have the same ranking. The rankings themselves are totally ordered. Search engines rank web pages by their expected relevance to a user’s query using a combination of query-dependent and query-independent methods. Query-independent methods attempt to measure the estimated importance of a page, independent of any consideration of how well it matches the specific query. Query-independent ranking is usually based on link analysis; examples include the HITS algorithm, PageRank, and TrustRank. ← Wikipedia

1. Related terms: Query language · Style query · TrustRank · Query
2. Previous term: Random-access memory
3. Next term: Rapid application building
4. Random term: VLQ (webglossary.info/random 🎲)