Everything about Data structure
Particular way of storing and organizing data in a computer
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 is the physical implementation of a data type, including specifications of the data organization and storage format, as well as functions or operations for working with this data. Data structures are closely related to abstract data types (ADTs). The data structure describes the representation of data in memory and how operations are carried out, while the ADT describes the logical form or algebraic structure of the data type—what operations are allowed and what results they produce—without describing how those operations are implemented. Some authors do not use the term "abstract data type" and simply refer to the logical and physical forms of the data structure. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Data structureA 5-minute orientation
- Skim a recent paper: AlphaFold Protein Structure Database in 2024: providing structure coverage for over 214 million protein sequencesInfluential work since 2022
- Pick up a classic book: Invisible WomenThe most-reprinted book on the subject
- Read the landmark paper: Inference of Population Structure Using Multilocus Genotype DataCited 24,335 times
- Go sideways: Linked listA closely related topic
- Go sideways: TrieA closely related topic
📖 Definitions
Noun Any form of storing and organizing data in a computer so that it can be accessed efficiently.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Inference of Population Structure Using Multilocus Genotype Data
Data structure forsoft objects
Structure-revealing data fusion
Data structure diagrams
Structure identification in relational data
Evaluated nuclear structure data file
Inferring structure in semistructured data
Structure calculation from NMR data
🆕 Influential since 2022
AlphaFold Protein Structure Database in 2024: providing structure coverage for over 214 million protein sequences
High-entropy nanoparticles: Synthesis-structure-property relationships and data-driven discovery
RCSB Protein Data Bank (RCSB.org): delivery of experimentally-determined PDB structures alongside one million computed structure models of proteins from artificial intelligence/machine learning
Ephemeral data derived potentials for random structure search
MathOptInterface: A Data Structure for Mathematical Optimization Problems
📚 Books worth reading
Invisible WomenCaroline Criado Perez · 2019
C++ ProgrammingD. S. Malik · 2004
Data-structures and programmingMalcolm C. Harrison · 1970
Data miningJiawei Han, Micheline Kamber · 2000
Data structures and algorithms in JavaMichael T. Goodrich, Roberto Tamassia · 2001
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Python for Data Science for DummiesJohn Paul Mueller, Luca Massaron · 2015
Data structures & problem solving using JavaMark Allen Weiss · 1998
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Linked list In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each…
- 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…
- Array (data structure) In computer science, an array is a data structure consisting of a collection of elements (values or variables), of the same memory size, each identified…
- Queue (abstract data type) In computer science, a queue is an abstract data type that serves as an ordered collection of entities. By convention, the end of the queue where elements…
- Dynamic array In computer science, a dynamic array, growable array, resizable array, dynamic table, mutable array, or array list is a random access, variable-size list…
- Heap (data structure) In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node…
- Abstract data type In computer science, an abstract data type (ADT) is a mathematical model for data types, defined by its behavior (semantics) from the point of view of…
- Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…