About: Search algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Search algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

In computer science, a search algorithm is an algorithm (typically involving a multitude of other, more specific algorithms ) which solves a search problem. Search algorithms work to retrieve information stored within some data structure, or calculated in the search space of a problem domain, with either discrete or continuous values.

Attributes	Values
rdf:type	Thing music genre software
rdfs:label	Search algorithm (en)
rdfs:comment	In computer science, a search algorithm is an algorithm (typically involving a multitude of other, more specific algorithms ) which solves a search problem. Search algorithms work to retrieve information stored within some data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. (en)
rdfs:seeAlso	Solver
sameAs	Search algorithm Search algorithm
dbp:wikiPageUsesTemplate	dbt:Annotated_link dbt:Cite_journal dbt:Full_citation_needed dbt:Main dbt:Math dbt:More_citations_needed dbt:Multiple_issues dbt:Refbegin dbt:Refend dbt:Reflist dbt:See_also dbt:Sfn dbt:Short_description dbt:Specific dbt:TAOCP
Subject	Internet search algorithms Ranking functions Search algorithms
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Search_algorithm?oldid=1071986901&ns=0
Wikipage page ID	28249 (xsd:integer)
page length (characters) of wiki page	13625 (xsd:nonNegativeInteger)
Wikipage revision ID	1071986901 (xsd:integer)
has abstract	In computer science, a search algorithm is an algorithm (typically involving a multitude of other, more specific algorithms ) which solves a search problem. Search algorithms work to retrieve information stored within some data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. While the search problems described above and web search are both problems in information retrieval, they are generally studied as separate subfields and are solved and evaluated differently. Web search problems are generally focused on filtering and finding documents that are most relevant to human queries. Classic search algorithms are typically evaluated on how fast they can find a solution, and whether that solution is guaranteed to be optimal. Though information retrieval algorithms must be fast, the quality of ranking, and whether good results have been left out and bad results included, is more important. The appropriate search algorithm often depends on the data structure being searched, and may also include prior knowledge about the data. Search algorithms can be made faster or more efficient by specially constructed database structures, such as search trees, hash maps, and database indexes. Search algorithms can be classified based on their mechanism of searching into three types of algorithms: linear, binary, and hashing. Linear search algorithms check every record for the one associated with a target key in a linear fashion. Binary, or half-interval, searches repeatedly target the center of the search structure and divide the search space in half. Comparison search algorithms improve on linear searching by successively eliminating records based on comparisons of the keys until the target record is found, and can be applied on data structures with a defined order. Digital search algorithms work based on the properties of digits in data structures that use numerical keys. Finally, hashing directly maps keys to records based on a hash function. Algorithms are often evaluated by their computational complexity, or maximum theoretical run time. Binary search functions, for example, have a maximum complexity of O(log n), or logarithmic time. This means that the maximum number of operations needed to find the search target is a logarithmic function of the size of the search space. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Search_algorithm
is Wikipage redirect of	Search Algorithms Search ranking algorithm Searching algorithm Searching algorithms Applications of search algorithms Search Algorithm Keyword Search Method Search algorithms Adversarial search Array search Ranking Algorithm Informed search Informed search algorithm Uninformed search algorithm
is Link from a Wikipage to another Wikipage of	Fly algorithm Forwarding plane Greedy triangulation Green computing List of terms relating to algorithms and data structures Location awareness Machine learning Machine learning in video games Mark Davis (Unicode) No free lunch in search and optimization Nondeterministic algorithm Null-move heuristic A* search algorithm AI winter Admissible heuristic Alexander Kronrod Algolia Algorithm Algorithmic technique Algorithms + Data Structures = Programs Alpha–beta pruning Amazon Marketplace Answer set programming Apache Lucene Apache OODT Apache Solr Apache Tika Applications of artificial intelligence Applications of randomness Applications of search algorithms Artificial intelligence Australian Web Archive Beam search Beam stack search Bees algorithm Best-first search Best bin first Best node search Binary search algorithm Binary search tree Binary tree Biological network Biomedical text mining Boogaloo movement Monika Henzinger Monotonic function Monte Carlo tree search Breadth-first search CS50 Cake Browser Carla Gomes Genetic algorithm Gigablast

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software