Particular way of storing and organizing data in a computer
For other uses, see Data structure (disambiguation).Not to be confused with Data type or Data model.
For information on Wikipedia's data structure, see Wikipedia:Administration § Data structure and development.
A data structure known as a hash table.
In computer science, a data structure is a data organization, and storage format that is usually chosen for efficient access to data.[1][2][3] More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data,[4] i.e., it is an algebraic structure about data.
^Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press. ISBN 978-0262033848.
^Black, Paul E. (15 December 2004). "data structure". In Pieterse, Vreda; Black, Paul E. (eds.). Dictionary of Algorithms and Data Structures [online]. National Institute of Standards and Technology. Retrieved 2018-11-06.
^"Data structure". Encyclopaedia Britannica. 17 April 2017. Retrieved 2018-11-06.
^Wegner, Peter; Reilly, Edwin D. (2003-08-29). Encyclopedia of Computer Science. Chichester, UK: John Wiley and Sons. pp. 507–512. ISBN 978-0470864128.
Datastructure alignment is the way data is arranged and accessed in computer memory. It consists of three separate but related issues: data alignment...
In computing, a persistent datastructure or not ephemeral datastructure is a datastructure that always preserves the previous version of itself when...
is a list of well-known datastructures. For a wider list of terms, see list of terms relating to algorithms and datastructures. For a comparison of running...
datastructure (PDS), also termed a plain old datastructure or plain old data (POD), is a record, in contrast with objects. It is a datastructure that...
minerals and chemicals. Abstract structures include datastructures in computer science and musical form. Types of structure include a hierarchy (a cascade...
A data model explicitly determines the structure of data; conversely, structureddata is data organized according to an explicit data model or data structure...
In computer science, a linked datastructure is a datastructure which consists of a set of data records (nodes) linked together and organized by references...
A datastructure diagram (DSD) is the visual representation of a certain kind of data model that contains entities, their relationships, and the constraints...
possible operations on data of this type, and the behavior of these operations. This mathematical model contrasts with datastructures, which are concrete...
In computer science, a succinct datastructure is a datastructure which uses an amount of space that is "close" to the information-theoretic lower bound...
compressed datastructure arises in the computer science subfields of algorithms, datastructures, and theoretical computer science. It refers to a data structure...
data. Data is usually organized into structures such as tables that provide additional context and meaning, and which may themselves be used as data in...
In computer science, a concurrent datastructure is a particular way of storing and organizing data for access by multiple computing threads (or processes)...
In computer science, a search datastructure[citation needed] is any datastructure that allows the efficient retrieval of specific items from a set of...
In computer science, an oblivious datastructure is a datastructure that gives no information about the sequence or pattern of the operations that have...
A kinetic datastructure is a datastructure used to track an attribute of a geometric system that is moving continuously. For example, a kinetic convex...
Global Information