Search engine indexing: Difference between revisions

Revision as of 11:22, 10 April 2024

Revision as of 11:25, 10 April 2024

Line 15:

; Storage techniques: How to store the index [[data]], that is, whether information should be data compressed or filtered.

; Index size: How much [[Computer data storage|computer storage]] is required to support the index.

; Lookup speed: Website speed optimization<ref>{{Cite web |last=Gupta |first=Alisha |date=2020-02-28 |title=Website Speed Optimization - Tips For How To Optimize Website Speed? |url=https://www.amritsardigitalacademy.in/blog/how-to-optimize-website-speed/ |url-status=live |access-date=2024-04-10 |website=Amritsar Digital Academy {{!}} Blog |language=en-US}}</ref> is one of the top factors that highly used search engines, such as Google & Bing, take into consideration while ranking websites. How quickly a word can be found in the [[inverted index]]. The speed of finding an entry in a data structure, compared with how quickly it can be updated or removed, is a central focus of computer science.

; Maintenance: How the index is maintained over time.<ref>Cutting, D., Pedersen, J.: Optimizations for dynamic inverted index maintenance. Proceedings of SIGIR, 405-411, 1990.</ref>

;Fault tolerance: How important it is for the service to be reliable. Issues include dealing with index corruption, determining whether bad data can be treated in isolation, dealing with bad hardware, [[partition (database)|partitioning]], and schemes such as [[hash function|hash-based]] or composite partitioning,<ref>[http://dev.mysql.com/doc/refman/5.1/en/partitioning-linear-hash.html Linear Hash Partitioning]. MySQL 5.1 Reference Manual. Verified Dec 2006</ref> as well as [[Replication (computer science)|replication]].