Wikipedia - Benutzerbeiträge [de]

Benutzer:Wladefant/Liste der Datenstrukturen

2007-07-10T05:04:53Z

203.129.195.140:

This is a list of [[data structure]]s. For a wider list of terms, see [[list of terms relating to algorithms and data structures]].

==Linear data structures==
{|class=wikitable
|-
!General type !! Specific types
|-
|rowspan=4|[[List (computing)|List]] (or vector)
|
*[[Array]]
**[[Bitmaps]]
***[[digital image|Images]]
***[[Heightfields]]
**[[Dynamic array]]
**[[Parallel array]]
**[[Sparse array]]
**[[Matrix (computer science)|Matrix]]
***[[Sparse matrix]]
**[[Bitboard]]
|-
|
*[[Linked list]]
**[[Unrolled linked list]]
**[[Xor linked list]]
**[[Doubly linked list]]
|-
|
*[[VList]]
|-
|
*[[Line]]
**[[Stack (data structure)|Stack]]
**[[Queue (data structure)|Queue]]
***[[Priority queue]]
**[[Deque]]
**[[Circular buffer]]
|-
|rowspan=3| [[Associative array]] <br/>(a.k.a. dictionary or map)
|
*[[Hash table]]
|-
|
*[[Self-balancing binary search tree]]
|-
|
*[[Skip list]]
|-
|}

==Non linear data structures==
{|class=wikitable
|-
!General type !! Specific types
|-
|[[Graph]] data structures
|
*[[Adjacency list]]
*[[Adjacency matrix]]
*[[Disjoint-set data structure]]
*[[Graph-structured stack]]
*[[Scene graph]]
*[[Frame]]
*[[Database]]
|-
|rowspan=6| [[Tree data structure|Tree]] data structures
|
*[[M-Way Tree]]
**[[B-tree]]
***[[2-3-4 tree]]
***[[B+ tree]]
***[[B*-tree]]
***[[UB-tree]]
***[[R-tree]]
****[[R+ tree]]
****[[R* tree]]
|-
|
*[[Binary tree]]
**[[Binary search tree]]s (each tree node compares entire key values)
***[[Self-balancing binary search tree]]s
****[[AVL tree]]
****[[Red-black tree]]
*****[[AA tree]]
****[[Scapegoat tree]]
****[[Splay tree]]
****[[Top Trees]]
***[[Interval tree]]
***[[Treap]]
|-
|
*[[Trie]] family (each tree node compares a bitslice of key values)
**[[Radix tree]]
**[[van Emde Boas tree]]
**[[Suffix tree]]
***[[Directed Acyclic Word Graph (DAWG)]]
|-
|
*[[Heap (data structure)|Heap]]
**[[Binary heap]]
**[[Binomial heap]]
**[[Fibonacci heap]]
**[[2-3 heap]]
**[[Soft heap]]
** [[Pairing heap]]
** [[Leftist tree|Leftist heap]]
** [[Treap]]
** [[Beap]]
** [[Skew heap]]
|-
|
*[[Parse tree]]
|-
|
*[[Space partitioning]]
**[[BSP tree]]
***[[Kd-tree]]
****[[Kdb-tree]]
**[[Quadtree]]
**[[Octree]]
|}

==Base data structures==
{|class=wikitable
|-
!General type !! Specific types
|-
|rowspan=1|primitive [[data types]]
|
*[[Integer_%28computer_science%29|int]]
*[[Character (computer_science)|char]]
|-
|rowspan=1|[[struct]] or Composite
|
*[[Integer_%28computer_science%29|Integer]]
*[[String_%28computer_science%29|String]]
*[[Double_%28computer_science%29|Double]]
*[[Float_%28computer_science%29|Float]]
*[[Union_%28computer_science%29|Union]]
**[[Tagged union]]
*[[Gap buffer|Gap Buffer]]
|-
|}

==Comparison==

An attempt to classify data structures based on feature attributes:

{| border="1" cellspacing="0"
!Structure
!Ordered
!Unique
!Cells per Node
|-
|Bag ([[multiset]])
|no
|no
|1
|-
|[[Set (computer science)|Set]]
|no
|yes
|1
|-
|[[List (computing)|List]]
|yes
|no
|1
|-
|[[Associative array|Map]]
|no
|yes
|2
|}

"Ordered" does not mean sorted, only that input order is "retained". Other structures such as "linked list" and "stack" cannot easily be defined this way because there are specific operations associated with them.

[[Category:Data structures]]

[[es:Estructura de datos]]
[[ru:Список структур данных]]

Benutzer:Wladefant/Liste der Datenstrukturen

2007-06-21T14:15:49Z

203.129.195.140: ←Blanked the page

Benutzer:Wladefant/Liste der Datenstrukturen

2007-06-21T14:04:22Z

203.129.195.140:

This is a list of [[data structure]]s. For a wider list of terms, see [[list of terms relating to algorithms and data structures]].

==Linear data structures==
{|class=wikitable
|-
!General type !! Specific types
|-
|rowspan=4|[[List (computing)|List]] (or vector)
|
*[[Array]]
**[[Bit]]
***[[digital image|Images]]
***[[Heightfields]]
**[[Dynamic array]]
**[[Parallel array]]
**[[Sparse array]]
**[[Matrix (computer science)|Matrix]]
***[[Sparse matrix]]
**[[Bitboard]]
|-
|
*[[Linked list]]
**[[Unrolled linked list]]
**[[Xor linked list]]
**[[Doubly linked list]]
|-
|
*[[VList]]
|-
|
*[[Line]]
**[[Stack (data structure)|Stack]]
**[[Queue (data structure)|Queue]]
***[[Priority queue]]
**[[Deque]]
|-
|rowspan=3| [[Associative array]] <br/>(a.k.a. dictionary or map)
|
*[[Hash table]]
|-
|
*[[Self-balancing binary search tree]]
|-
|
*[[Skip list]]
|-
|}

==Non linear data structures==
{|class=wikitable
|-
!General type !! Specific types
|-
|[[Graph]] data structures
|
*[[Adjacency list]]
*[[Adjacency matrix]]
*[[Disjoint-set data structure]]
*[[Graph-structured stack]]
*[[Scene graph]]
*[[Frame]]
*[[Database]]
|-
|rowspan=6| [[Tree data structure|Tree]] data structures
|
*[[M-Way Tree]]
**[[B-tree]]
***[[2-3-4 tree]]
***[[B+ tree]]
***[[B*-tree]]
***[[UB-tree]]
***[[R-tree]]
****[[R+ tree]]
****[[R* tree]]
|-
|
*[[Binary tree]]
**[[Binary search tree]]s (each tree node compares entire key values)
***[[Self-balancing binary search tree]]s
****[[AVL tree]]
****[[Red-black tree]]
*****[[AA tree]]
****[[Scapegoat tree]]
****[[Splay tree]]
***[[Interval tree]]
***[[Treap]]
|-
|
*[[Trie]] family (each tree node compares a bitslice of key values)
**[[Radix tree]]
**[[van Emde Boas tree]]
**[[Suffix tree]]
***[[Directed Acyclic Word Graph (DAWG)]]
|-
|
*[[Heap (data structure)|Heap]]
**[[Binary heap]]
**[[Binomial heap]]
**[[Fibonacci heap]]
**[[2-3 heap]]
**[[Soft heap]]
** [[Pairing heap]]
** [[Leftist tree|Leftist heap]]
** [[Treap]]
** [[Beap]]
** [[Skew heap]]
|-
|
*[[Parse tree]]
|-
|
*[[Space partitioning]]
**[[BSP tree]]
***[[Kd-tree]]
****[[Kdb-tree]]
**[[Quadtree]]
**[[Octree]]
|}

==Base data structures==
{|class=wikitable
|-
!General type !! Specific types
|-
|rowspan=1|primitive [[data types]]
|
*[[Integer_%28computer_science%29|int]]
*[[Character (computer_science)|char]]
|-
|rowspan=1|[[struct]] or Composite
|
*[[Integer_%28computer_science%29|Integer]]
*[[String_%28computer_science%29|String]]
*[[Double_%28computer_science%29|Double]]
*[[Float_%28computer_science%29|Float]]
*[[Union_%28computer_science%29|Union]]
**[[Tagged union]]
*[[Gap buffer|Gap Buffer]]
|-
|}

==Comparison==

An attempt to classify data structures based on feature attributes:

{| border="1" cellspacing="0"
!Structure
!Ordered
!Unique
!Cells per Node
|-
|Bag ([[multiset]])
|no
|no
|1
|-
|[[Set (computer science)|Set]]
|no
|yes
|1
|-
|[[List (computing)|List]]
|yes
|no
|1
|-
|[[Associative array|Map]]
|no
|yes
|2
|}

"Ordered" does not mean sorted, only that input order is "retained". Other structures such as "linked list" and "stack" cannot easily be defined this way because there are specific operations associated with them.

[[Category:Data structures]]

[[es:Estructura de datos]]
[[ru:Список структур данных]]