In computer science, a search data structure[citation needed] is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database.
The simplest, most general, and least efficient search structure is merely an unordered sequential list of all the items. Locating the desired item in such a list, by the linear search method, inevitably requires a number of operations proportional to the number n of items, in the worst case as well as in the average case. Useful search data structures allow faster retrieval; however, they are limited to queries of some specific kind. Moreover, since the cost of building such structures is at least proportional to n, they only pay off if several queries are to be performed on the same database (or on a database that changes little between queries).
Static search structures are designed for answering many queries on a fixed database; dynamic structures also allow insertion, deletion, or modification of items between successive queries. In the dynamic case, one must also consider the cost of fixing the search structure to account for the changes in the database.
and 18 Related for: Search data structure information
In computer science, a searchdatastructure[citation needed] is any datastructure that allows the efficient retrieval of specific items from a set of...
is a list of well-known datastructures. For a wider list of terms, see list of terms relating to algorithms and datastructures. For a comparison of running...
In computing, a persistent datastructure or not ephemeral datastructure is a datastructure that always preserves the previous version of itself when...
In computer science, a linked datastructure is a datastructure which consists of a set of data records (nodes) linked together and organized by references...
appropriate search algorithm to use often depends on the datastructure being searched, and may also include prior knowledge about the data. Search algorithms...
specialized datastructures designed for fast searching, such as hash tables, that can be searched more efficiently than binary search. However, binary search can...
compressed datastructure arises in the computer science subfields of algorithms, datastructures, and theoretical computer science. It refers to a data structure...
In computer science, a succinct datastructure is a datastructure which uses an amount of space that is "close" to the information-theoretic lower bound...
computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree datastructure with the key of each internal...
science, a search tree is a tree datastructure used for locating specific keys from within a set. In order for a tree to function as a search tree, the...
visiting (e.g. retrieving, updating, or deleting) each node in a tree datastructure, exactly once. Such traversals are classified by the order in which...
algorithms and datastructures. For algorithms and datastructures not necessarily mentioned here, see list of algorithms and list of datastructures. This list...
efficient datastructures that implement associative arrays. The two major solutions to the dictionary problem are hash tables and search trees. It is...
For example, one may sort the list and use binary search, or build an efficient searchdatastructure from it. Should the content of the list change frequently...
data structure. This complexity for lookups is the same as for self-balancing binary search trees. In some datastructures, an array of structures is used...
Global Information