Search algorithm: Difference between revisions

Revision as of 20:15, 23 December 2018

Revision as of 23:56, 10 January 2019

Line 3:

{{Expert needed|computer science|talk=Calling for expert attention|reason=longstanding subpar state of article structure and content, which is currently list based, dated, and non-encyclopedic, and without external sourcing |date=December 2014}}

{{specific|date=December 2014}}

{{RefimproveMore citations needed|date=April 2016}}

}}

[[File:Hash table 3 1 1 0 1 0 0 SP.svg|thumb|upright=1.2|Visual representation of a [[hash table]], a [[data structure]] that allows for fast retrieval of information.]]

Line 23:

* Checking to see if a given value is present in a set of values

The classic search problems described above and [[web search]] are both problems in [[information retrieval]], but are generally studied as separate subfields and are solved and evaluated differently. [[Category:Internet search algorithms|Web search algorithms]]
are generally focused on filtering and [[Category:Ranking functions|ranking algorithms]]
that find documents most relevant to human queries. Classic search algorithms are typically evaluated on how fast they can find a solution, and whether or not that solution is guaranteed to be optimal. Though information retrieval algorithms must be fast, the quality of ranking is more important, as is whether or not good results have been left out and bad results included.

The appropriate search algorithm often depends on the data structure being searched, and may also include prior knowledge about the data. Some database structures are specially constructed to make search algorithms faster or more efficient, such as a [[search tree]], [[hash map]], or a [[database index]]. {{Sfn|Beame|Fich|2002|p=39}}{{Sfn|Knuth|1998|loc=§6.5 ("Retrieval on Secondary Keys")}}

Line 46 ⟶ 48:

|title=A Group-Testing Algorithm with Online Informational Learning

|author= Kagan E. and Ben-Gal I.

|publisher= IIE Transactions, 46:2, 164-184,

|year=2014

}}</ref> and the [[A* search algorithm|A* algorithm]].

Line 97 ⟶ 99:

{{Refend}}

[[Category:Internet search algorithms|Web search algorithms]]

[[Category:Ranking functions|ranking algorithms]]

[[Category:Search algorithms| ]]