data structure
particular way of storing and organizing data in a computer
matrix representation
storage method in computer memory
substring index
data structure to allow fast searches for substrings
Scan-Line Interleave
interleaving of scan-line in rendering, file formats or data structures
hash tree
persistent data structure for hashes
device tree
data structure used to describe the hardware components of a computer to the kernel
conflict-free replicated data type
data structure replicated across a network such that any replica is updatable independently, concurrently and without coordination, and any inconcistencies are algorithmically resolved with replicas’ states guaranteed to eventually converge
hash tree
tree data structure whose nodes are recursively cryptographically hashed
process control block
data structure in the operating system kernel containing the information needed to manage a particular process
polygon mesh
set of edges, vertices, and polygons which define a 3D model's shape
Fibonacci heap
heap data structure made of a forest of trees
index structure
term in computer science
B*-tree
B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes
bit field
data structure used in computer programming
graph data structure
abstract data type in computer science
graph data structure
abstract data type in computer science
zipper
technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents
User Electronic Signature
user-defined bitfield in a programmable logic device
splay tree
self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again
stack
abstract data type
k-d tree
multidimensional search tree for points in k dimensional space
binary search tree
data structure in tree form with 0, 1, or 2 children per node, sorted for fast lookup
use-define chain
data structure that tracks variable use and definitions
Memory map
data structure
call stack
stack data structure that stores information about the active subroutines of a computer program
Program Segment Prefix
data structure used in MS-DOS (and compatible) operating systems to store the state of a running program
triangulated irregular network
geometric data structure
Judy array
data structure implementing a type of associative array with high performance and low memory usage
passive data structure
another term for record
R*-tree
a variant of R-trees used for indexing spatial information
sorted array
array data structure in which each element is sorted in numerical, alphabetical, or some other order
Unit Control Block
component of IBM mainframe operating systems
tree
abstract data type
block
sequence of bytes or bits, having a nominal length (a block size)
page table
data structure that maps virtual addresses with physical addresses
summed-area table
Type of data structure algorithm
segment tree
tree data structure used in computer science
scapegoat tree
type of self-balancing binary search tree
Bridge Protocol Data Units
frames that contain information about the spanning tree protocol
line
subdivision of a text file
exponential tree
tree data structure similar to the binary search tree where the dimension of the tree is not the same at all levels
hashed array tree
dynamic array data structure
list
abstract data type used in computer science
adjacency list
data structure representing a graph
database index
data structure for database query optimization at the expense of write and storage to maintain the index structure
system image
data structure storing the entire state of a computer
R-tree
tree-based data structure, used to index spatial information
min-max heap
data structure