data structure
particular way of storing and organizing data in a computer
partition table
table maintained on disk by a computer operating system describing the partitions on that disk
range tree
data structure
union type
data structure
circular buffer
data structure
frame
data transmission unit
File Control Block
data structure used for file access in CP/M, MS-DOS and compatible operating systems
Stream
potentially infinite analog of a list, in type theory and functional programming
Log-structured merge-tree
data structure
Retroactive data structures
data structures that allow modifications to past actions
array data structure
data structure holding elements in a contiguous memory block
disjoint-set data structure
data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets
symbol table
data structure used by a language translator such as a compiler or Interpreter
persistent data structure
data structure that always preserves the previous version of itself when it is modified
Rendezvous
data synchronization mechanism in Plan 9
B-heap
data structure
Data Control Block
data structure in OS/360 and successor operating systems describing a data set in use by a program
succinct data structure
data structure in computer science
implicit data structure
data structure that stores very little information other than the main or required data
Fractal tree index
tree data structure
credit line
method by which institutions declare the acquisition of collection items
Relaxed k-d tree
Multidimensional search tree for spatial coordinates.
hash table
associates data values with key values - a lookup table
extent
variable-sized, contiguous area of storage that some filesystems use as a unit of disk space allocation
binary heap
heap data structure that takes the form of a binary tree
continuation
in computer science, a data structure that represents the computational process at a given point in the process's execution
nested set model
technique related to database
(a,b)-tree
type of balanced search tree
bidirectional map
associative data structure whose key–value pairs are in bijection
level set
data structures
skip graph
distributed data structure
purely functional data structure
persistent data structure that does not rely on mutable state
Linear Data Set
IBM data record organization type
associative array
data type that associates keys with values
dynamic array
random-access, variable-size list data structure that allows elements to be added or removed
intermediate representation
data structure or code used internally by a compiler or virtual machine to represent source code. An IR is designed to be conducive for further processing, such as optimization and translation
B-tree
a self-balancing, tree-based data structure, that allows read/write access in logarithmic time
B-tree
a self-balancing, tree-based data structure, that allows read/write access in logarithmic time
flag
one or more bits that are used to store a binary value or code that has an assigned meaning, but can refer to uses of other data type
radix heap
data structure for realizing the operations of a monotone priority queue
feature data
object in geographic information systems that can have a geographic location and other properties
semantic triple
atomic data entity in the Resource Description Framework (RDF) data model; set of three entities that codifies a statement about semantic data in the form of subject–predicate–object expressions
Thread control block
data structure in operating system with thread-specific information needed to manage it
Association list
Linked list of key-value pairs
block allocation map
data structure used to track disk blocks in use
C-trie
Type of a data structure
concurrent data structure
particular way of storing and organizing data for access by multiple computing threads (or processes) on a computer
Kinetic heap
data structure
linked data structure
data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers)