Data structure
In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently.
Contents
Implementation of abstract data structures
Data structures can implement one or more particular abstract data types (ADT), which are the means of specifying the contract of operations and their complexity.
In comparison, a data structure is a concrete implementation of the contract provided by an ADT.
Applications
Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks.
- Databases use B-tree indexes for small percentages of data retrieval
- Compilers and databases use dynamic hash tables as look up tables
Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services.
Algorithms
Usually, efficient data structures are key to designing efficient algorithms.
Design methods
Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.
See also
- Abstract data type
- Algorithm
- Checksum
- Computing
- Computer science
- Concurrent data structure
- Data
- Data (computing)
- Data model
- Data type
- Dynamization
- Hash table
- Linked data structure
- Linked list
- List of data structures
- Persistent data structure
- Plain old data structure
- Random access
- Serialization - the process of translating data structures or object state into a format that can be stored (for example, in a file or memory buffer, or transmitted across a network connection link) and reconstructed later in the same or another computer environment.
- Structure
- Zipper (data structure) - a technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents, especially in purely functional programming languages.
External links
- Data structure @ Wikipedia
