This article is about a data structure. For retrieving information from texts, see Information retrieval.
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
The neutrality of this article is disputed. Relevant discussion may be found on the talk page. Please do not remove this message until conditions to do so are met.(November 2021) (Learn how and when to remove this message)
This article relies excessively on references to primary sources. Please improve this article by adding secondary or tertiary sources. Find sources: "Retrieval Data Structure" – news · newspapers · books · scholar · JSTOR(November 2021) (Learn how and when to remove this message)
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Retrieval Data Structure" – news · newspapers · books · scholar · JSTOR(December 2021) (Learn how and when to remove this message)
A major contributor to this article appears to have a close connection with its subject. It may require cleanup to comply with Wikipedia's content policies, particularly neutral point of view. Please discuss further on the talk page.(November 2021) (Learn how and when to remove this message)
(Learn how and when to remove this message)
In computer science, a retrieval data structure, also known as static function, is a space-efficient dictionary-like data type composed of a collection of (key, value) pairs that allows the following operations:[1]
Construction from a collection of (key, value) pairs
Retrieve the value associated with the given key or anything if the key is not contained in the collection
Update the value associated with a key (optional)
They can also be thought of as a function for a universe and the set of keys where retrieve has to return for any value and an arbitrary value from otherwise.
In contrast to static functions, AMQ-filters support (probabilistic) membership queries and dictionaries additionally allow operations like listing keys or looking up the value associated with a key and returning some other symbol if the key is not contained.
As can be derived from the operations, this data structure does not need to store the keys at all and may actually use less space than would be needed for a simple list of the key value pairs. This makes it attractive in situations where the associated data is small (e.g. a few bits) compared to the keys because we can save a lot by reducing the space used by keys.
To give a simple example suppose video game names annotated with a boolean indicating whether the game contains a dog that can be petted are given. A static function built from this database can reproduce the associated flag for all names contained in the original set and an arbitrary one for other names. The size of this static function can be made to be only bits for a small which is obviously much less than any pair based representation.[1]
^ abStefan, Walzer (2020). Random hypergraphs for hashing-based data structures (PhD). pp. 27–30.
and 26 Related for: Retrieval Data Structure information
In computer science, a retrievaldatastructure, also known as static function, is a space-efficient dictionary-like data type composed of a collection...
Dataretrieval means obtaining data from a database management system (DBMS), like for example an object-oriented database (ODBMS). In this case, it is...
B-tree indexes for dataretrieval, while compiler implementations usually use hash tables to look up identifiers. Datastructures provide a means to manage...
for the metadata that describes data, and for databases of texts, images or sounds. Automated information retrieval systems are used to reduce what has...
according to whether they are database query languages or information retrieval query languages. The difference is that a database query language attempts...
Japanese. A subset of EPWING V1 is standardized as JIS X 4081 (Retrievaldatastructure for Japanese electronic publication). At 1986, Fujitsu, Iwanami...
In computer science, a search datastructure[citation needed] is any datastructure that allows the efficient retrieval of specific items from a set of...
The (standard) Boolean model of information retrieval (BIR) is a classical information retrieval (IR) model and, at the same time, the first and most-adopted...
The Teleoperator Retrieval System was an uncrewed space tug ordered by NASA in the late 1970s to re-boost Skylab using the Space Shuttle. TRS was a design...
Data extraction is the act or process of retrieving data out of (usually unstructured or poorly structured) data sources for further data processing or...
Research data archiving is the long-term storage of scholarly research data, including the natural sciences, social sciences, and life sciences. The various...
Music information retrieval (MIR) is the interdisciplinary science of retrieving information from music. Those involved in MIR may have a background in...
after 2007. All image retrieval systems as of 2021 were designed for 2D images, not 3D ones. Image search is a specialized data search used to find images...
is a priority queue datastructure. The datastructure allows insertions and deletions of arbitrary elements, as well as retrieval of the highest-priority...
indexing is the collecting, parsing, and storing of data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts...
tertiary structureretrieval and develop online tool based on research outcome. Folding (chemistry) I-TASSER Nucleic acid tertiary structure Protein contact...
performed on given abstract data types. Therefore data must be stored in a way which is suitable later for fast retrieval. The retrieval is done without help...
hash tables are used in data storage and retrieval applications to access data in a small and nearly constant time per retrieval. They require an amount...
Information Retrieval. The scope of the group's specialty is the theory and application of computers to the acquisition, organization, storage, retrieval and...
the study of information retrieval, not algorithmics. The appropriate search algorithm to use often depends on the datastructure being searched, and may...
Knowledge retrieval seeks to return information in a structured form, consistent with human cognitive processes as opposed to simple lists of data items....
can allow for easy retrieval of data. Clustering Pattern recognition List of text mining software Semi-structureddataStructureddata ^ Today's Challenge...
efficient for bulk loading data efficient for relatively small relations as indexing overheads are avoided efficient when retrievals involve large proportion...
itself, rather than its index. It is the most popular datastructure used in document retrieval systems, used on a large scale for example in search engines...
indices to allow fast retrieval of rows. In some situations the heap structure has performance advantages over the clustered structure. Both heaps and B-trees...
concerned with analysis, collection, classification, manipulation, storage, retrieval, movement, dissemination, and protection of information. Practitioners...
Global Information
