Data Structure

In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.

Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.

Data structures provide a means to manage huge amounts of data efficiently, such as large databases and internet indexing services. Usually, efficient data structures are a key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Storing and retrieving can be carried out on data stored in both main memory and in secondary memory. Various Data Structures are available that are needed to be employed based on the need. Every Data structure has different advantages and dis-advantages. Hence there is no Data structure which can be fully depended(like dependable Rahul Dravid) on in every situation. So various Data Structures come handy in various situations.

Read more about Data StructureOverview, Basic Principles, Language Support

Other articles related to "data structure, data, data structures":

Planarity Testing - Algorithms - Vertex Addition Method
... Vertex addition methods work by maintaining a data structure representing the possible embeddings of an induced subgraph of the given graph, and adding vertices ... and Lueker, who developed the PQ tree data structure ...
Luleå Algorithm - Second and Third Levels
... The second and third levels of the data structure are structured similarly to each other in each of these levels the Luleå algorithm must perform prefix matching on 8-bit quantities (bits 17–24 and 25 ... The data structure is structured in "chunks", each of which allows performing this prefix matching task on some subsequence of the address space the data items ...
Lowest Common Ancestor - History
... were the first to develop an optimally efficient lowest common ancestor data structure ... However, their data structure is complex and difficult to implement ... algorithm, based on the union-find data structure, for computing lowest common ancestors of an offline batch of pairs of nodes ...
Succinct Data Structure
... In computer science, a succinct data structure is data structure which uses an amount of space that is "close" to the information-theoretic lower bound, but (unlike ... Unlike general lossless data compression algorithms, succinct data structures retain the ability to use them in-place, without decompressing them first ... A related notion is that of a compressed data structure, in which the size of the data structure depends upon the particular data being represented ...
Data Structure - Language Support
... as BCPL (Basic Combined Programming Language), lack support for data structures ... or other built-in support for certain data structures, such as vectors (one-dimensional arrays) in the C language or multi-dimensional arrays in Pascal ... languages feature some sort of library mechanism that allows data structure implementations to be reused by different programs ...

Famous quotes containing the words structure and/or data:

    Why does philosophy use concepts and why does faith use symbols if both try to express the same ultimate? The answer, of course, is that the relation to the ultimate is not the same in each case. The philosophical relation is in principle a detached description of the basic structure in which the ultimate manifests itself. The relation of faith is in principle an involved expression of concern about the meaning of the ultimate for the faithful.
    Paul Tillich (1886–1965)

    This city is neither a jungle nor the moon.... In long shot: a cosmic smudge, a conglomerate of bleeding energies. Close up, it is a fairly legible printed circuit, a transistorized labyrinth of beastly tracks, a data bank for asthmatic voice-prints.
    Susan Sontag (b. 1933)