Live briefing
Everything about Retrieval Data Structure
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 pairs that allows the following operations:Construction from a collection of 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) Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Retrieval Data StructureA 5-minute orientation
- Skim a recent paper: Ground-based/UAV-LiDAR data fusion for quantitative structure modeling and tree parameter retrieval in subtropical planted forestInfluential work since 2022
- Pick up a classic book: Digital Forensics and WatermarkingThe most-reprinted book on the subject
- Read the landmark paper: Quad trees a data structure for retrieval on composite keysCited 1,521 times
- Go sideways: Approximate membership query filterA closely related topic
- Go sideways: Succinct data structureA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Quad trees a data structure for retrieval on composite keys
Amortized efficiency of a path retrieval data structure
Vegetation Structure Retrieval in Beech and Spruce Forests Using Spectrodirectional Satellite Data
Development of a hashing-based data structure for the fast retrieval of 3D terrestrial laser scanned data
Structure of hierarchic clusterings: implications for information retrieval and for multivariate data analysis
A New Efficient Data Structure for Storage and Retrieval of Multiple Biosequences
The ISO 25964 data model for the structure of an information retrieval thesaurus
Retrieval of jovian cloud structure from the Cassini ISS limb-darkening data
🆕 Influential since 2022
Ground-based/UAV-LiDAR data fusion for quantitative structure modeling and tree parameter retrieval in subtropical planted forest
Auroral 3D structure retrieval from the Juno/UVS data
Neural network based molecular structure retrieval from Coulomb explosion imaging data
Efficient Modeling of Ship Structure Based on Image Recognition and Data Retrieval
S-Gens: Structure-Aware Synthetic Data Generation for Enhancing Reasoning-Intensive Dense Retrieval
📚 Books worth reading
Digital Forensics and WatermarkingYun Qing Shi, Hyoung Joong Kim · 2012
Data miningJiawei Han, Micheline Kamber · 2000
Data modeling essentialsGraeme Simsion, Graham Witt · 1994
Data miningI. H. Witten, Ian H. Witten · 1999
Patterns of data modelingMichael Blaha · 2010
Information retrievalDavid A. Grossman, Ophir Frieder · 1998
Information retrievalWilliam B. Frakes, R. Baeza-Yates · 1992
Beautiful dataJeff Hammerbacher, Toby Segaran · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Approximate membership query filter Approximate membership query filters (hereafter, AMQ filters) comprise a group of space-efficient probabilistic data structures that support approximate…
- Succinct data structure In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound…
- Conditional disclosure of secrets Conditional disclosure of secrets (CDS) is a primitive, studied in information-theoretic cryptography, that allows distributed, non-communicating parties…
- Cuckoo filter A cuckoo filter is an space-efficient probabilistic data structure that is used to test whether an element is a member of a set, like a Bloom filter does…
- Ellipsoid method In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates…
- Information dimension In information theory, information dimension is an information measure for random vectors in Euclidean space, based on the normalized entropy of finely…
- Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
- Universal hashing In mathematics and computing, universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family…