Th Group: data structures

Group: data structures

Topic:
arrays
Topic:
associative memory
Topic:
b-trees
Topic:
data record
Topic:
graphs
Topic:
object slice
Topic:
persistent data structure
Topic:
recursive data structures
Topic:
sparse arrays
Topic:
stacks
Topic:
suffix trie and suffix array
Topic:
trees
Group:
derived data types
Group:
sequences

Topic:
attribute-value pairs as information
Topic:
data alignment
Topic:
data type as constructors, selectors, and predicates
Topic:
hash table and hash functions
Topic:
object-oriented classes
Topic:
object-oriented data types
Topic:
pointers to data
Topic:
Thesa data structures
Topic:
representing a relationship
Topic:
self-identifying data structures
Topic:
set data type

Subtopic: models for data structures

Quote: data structures consist of templates of arbitrary elements (e.g., functions); implement with pointers [»hallJC5_1974, OK]
Quote: data structures by a set of ordered pairs: index/element [»hehnEC_1977]
Quote: the serial file is the fundamental data structure; explored sequentially
Quote: define symbol table with Abstract Syntax Description Language (ASDL); auto generate code for data structures [»hansDR8_1999]
Quote: ASDL, abstract syntax description language, for describing intermediate representations; concise data structure definitions, pickling functions, and automated implementation; simplification of ASN.1 [»wangDS10_1997]
Quote: data structures built from nodes (programmer-defined types); components may be nodes or elements of a small number of types [»straC8_1967]

Subtopic: active data structures

Quote: the Connection Machine represents and processes data as 'active data structures' of interconnected processor and memory cells [»hillWD_1985]

Subtopic: special-purpose data structures

Quote: a diamond deque is a simple, symmetric, pointer-free data structure that combines a min-heap with a max-heap [»chanSC7_1993]
Quote: HAT structure can grow and shrink at the beginning; for double-ended queues and deques [»demaE7_2001]

Subtopic: memory-based data structures

Quote: use contiguous, pointer-free storage for in-memory data structures; random access is expensive, like disks [»zobeJ11_2005]
Quote: designed Google data structures to avoid disk seeks; a seek still takes 10 milliseconds [»brinS4_1998]

Subtopic: container and base classes

Quote: a base class is commonly used for container classes such as set, vector, and list; the container may be homogeneous or heterogeneous

Subtopic: heap data structure

Quote: the pairing heap is simpler and faster than the Fibonacci heap; min value at root; multiple children and no parent pointers
[»fredMl7_1999]

Group: data structures

Topic: arrays (58 items)
Topic: associative memory (5 items)
Topic: b-trees (16 items)
Topic: data record (57 items)
Topic: graphs (18 items)
Topic: object slice (3 items)
Topic: persistent data structure (37 items)
Topic: recursive data structures (18 items)
Topic: sparse arrays (6 items)
Topic: stacks (6 items)
Topic: suffix trie and suffix array (20 items)
Topic: trees
(21 items)

Related Topics

Group: derived data types (9 topics, 119 quotes)
Group: sequences (7 topics, 97 quotes)
Topic: attribute-value pairs as information (57 items)
Topic: data alignment (2 items)
Topic: data type as constructors, selectors, and predicates (20 items)
Topic: hash table and hash functions (41 items)
Topic: object-oriented classes (67 items)
Topic: object-oriented data types (29 items)
Topic: pointers to data (55 items)
Topic: Thesa data structures (59 items)
Topic: representing a relationship (28 items)
Topic: self-identifying data structures (18 items)
Topic: set data type
(16 items)