Live briefing
Everything about Associative array
Data structure holding key/value pairs
In computer science, an associative array, key-value store, map, symbol table, or dictionary is an abstract data type that stores a collection of key/value pairs, such that each possible key appears at most once in the collection. In mathematical terms, an associative array is a function with finite domain. It supports 'lookup', 'remove', and 'insert' operations. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Associative arrayA 5-minute orientation
- Skim a recent paper: A Low-Voltage Stretchable Synaptic Transistor Array for Temperature Perception, Facilitated Associative Learning, and Neuromorphic ComputingInfluential work since 2022
- Pick up a classic book: Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)The most-reprinted book on the subject
- Read the landmark paper: Brain-like associative learning using a nanoscale non-volatile phase change synaptic device arrayCited 190 times
- Go sideways: Hash tableA closely related topic
- Go sideways: Comparison of programming languages (associative array)A closely related topic
📖 Definitions
Noun An array-like data structure where the indices (called keys) are not limited to integers.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Brain-like associative learning using a nanoscale non-volatile phase change synaptic device array
Coupled-Oscillator Associative Memory Array Operation for Pattern Recognition
An associative analysis of gene expression array data
Associative Memory for Image Recovery with a High‐Performance Memristor Array
Oscillator Array Models for Associative Memory and Pattern Recognition
The Role of Associative Array Processers in Data Base Machine Architecture
The Associative Linear Array Processor
Sensory driven multi-neuronal activity and associative learning monitored in an intact CNS on a multielectrode array
🆕 Influential since 2022
📚 Books worth reading
Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)Svetlin Nakov · 2013
GenomeWide Prediction and Analysis of ProteinProtein Functional Linkages in Bacteria
Springerbriefs in Systems BiologyVijaykumar Yogesh Muley · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Hash table In computer science, a hash table is a data structure that implements an associative array, also called a dictionary or simply map; an associative array…
- Comparison of programming languages (associative array) This comparison of programming languages (associative arrays) compares the features of associative array data structures or array-lookup processing for…
- Set (abstract data type) In computer science, a set is an abstract data type that can store distinct values, without any particular order. It is a computer implementation of the…
- Radix tree In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie…
- Trie In computer science, a trie (/ˈtraɪ/, /ˈtriː/ ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store…
- Persistent data structure In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when…
- Data structure In computer science, a data structure is a way to organize and store data that is usually chosen for efficient access to data. More precisely, a data structure…
- Hash function A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support…