About: Search data structure

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

About: Search data structure Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatDataStructures, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSearch_data_structure

In computer science, a search data structure 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 datab

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:PsychologicalFeature100023100 yago:Structure105726345 yago:WikicatDataStructures
rdfs:label	Search data structure (en)
rdfs:comment	In computer science, a search data structure 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 datab (en)
dcterms:subject	Data structures
Wikipage page ID	24019691 (xsd:integer)
Wikipage revision ID	1121668041 (xsd:integer)
Link from a Wikipage to another Wikipage	Queue (abstract data type) List of data structures Big-O notation Information retrieval Linear search Longitude Stack (abstract data type) Computer science B-tree Trie Data structure Heap (data structure) K-d tree Linked list Database Earth Record (computer science) Hash table Jagged array Asymptotic analysis AVL tree Latitude Red–black tree Data structures Splay tree Constant time Cartesian tree Set (mathematics) Self-balancing binary search tree Sorted array Skip list Average case complexity List (computing) Worst case complexity Binary search Dimension (mathematics)
sameAs	Search data structure Search data structure Search data structure Search data structure Search data structure
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Reflist
has abstract	In computer science, a search data structure 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. (en)
prov:wasDerivedFrom	wikipedia-en:Search_data_structure?oldid=1121668041&ns=0
page length (characters) of wiki page	8571 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Search_data_structure
is rdfs:seeAlso of	Best, worst and average case
is Link from a Wikipage to another Wikipage of	Best, worst and average case Array (data type) Linear search Heap (data structure) Hash table Self-balancing binary search tree Sorted array Comparison of data structures Search data structures
is Wikipage redirect of	Comparison of data structures Search data structures
is foaf:primaryTopic of	wikipedia-en:Search_data_structure

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 52 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software