Skip to content
Skein

№00Glossary · 767

Glossary

Every technical term used across the curriculum, with a plain definition. Terms gain entries here as pieces are authored.

#

__resolveReferenceA per-entity resolver function required by the Apollo Federation subgraph spec. When the router…_entitiesA root-level Query field added to every Apollo Federation subgraph schema. The router sends a li…'use client' directiveA React directive placed at the top of a module file to declare that the file and everything it…/authorize endpointThe authorization server URL (RFC 6749 §3.1) where the client redirects the resource owner's bro…/token endpointThe OAuth 2.0 server endpoint (defined in RFC 6749) where a client exchanges an authorization gr…0-RTTA QUIC and TLS 1.3 mode where a returning client sends encrypted application data in its very fi…0/1 knapsackThe problem of maximizing total value over a subset of items whose total weight fits capacity W,…1-RTTThe standard QUIC handshake for a new connection: the client sends its TLS 1.3 ClientHello and Q…

A

abstract data type (ADT)A specification that describes what operations are supported and what they do, without specifyin…access tokenA short-lived credential, defined in OAuth 2.0 (RFC 6749), that a client presents to a resource…accumulatorA variable initialized before a loop that collects or combines values from each iteration—sum, p…ACKA TCP segment flag and field that confirms received data. The acknowledgment number tells the se…adaptive sortA sorting algorithm that detects and exploits existing order in its input, running faster when t…adder (circuit)A digital circuit that adds binary numbers. A half-adder takes two single-bit inputs and produce…adjacency listA graph representation using an array (or map) of lists, where each vertex stores a list of its…adjacency matrixA graph representation using a V×V matrix where cell [u][v] = 1 (or weight) if edge (u,v) exists…adjacentDescribes a vertex joined to another by an edge. If there is an edge (u, v), then v is adjacent…advisory lockAn application-defined PostgreSQL lock (pg_advisory_lock) not tied to any row or table — commonl…algorithmA finite, unambiguous sequence of instructions that transforms given inputs into desired outputs…alias bombA DNS attack in which an attacker crafts a chain of CNAME (alias) records that forces recursive…aliasing (variables)The situation where two or more variable names are bound to the same object in memory — both hol…ALPNA TLS extension (RFC 7301) where the client lists its supported application protocols in the Cli…Amdahl's lawAmdahl's law states that the maximum speedup of a program using multiple processors is bounded b…amortized timeThe average time per operation, computed over a sequence of operations. Some operations are expe…anagramTwo strings are anagrams if they contain the same characters with the same frequencies. Example:…AND (&)The bitwise operator whose result bit is 1 only if both input bits are 1. Used to read or clear…anycastA routing scheme where the same IP address is announced by multiple servers in different locatio…Apollo FederationAn open specification for composing multiple independently deployed GraphQL services (subgraphs)…AppendEntriesThe Raft RPC that a leader sends to followers both to replicate log entries and as a periodic he…APQ (Automatic Persisted Queries)An Apollo GraphQL protocol where the client sends only a SHA-256 hash of the query string instea…argumentA value supplied by the caller at the call site, e.g. add(3, 5) — 3 and 5 are arguments. Argumen…ARPAddress Resolution Protocol: maps a known IPv4 address to a MAC address within a local network s…arrayA data structure that stores elements of the same type in a contiguous block of memory, allowing…array indexAn element's position in an array, counted from 0. The index is converted to a memory address by…ASCIIAmerican Standard Code for Information Interchange. A 7-bit character encoding that maps integer…assemblerA program that translates assembly language source code into machine code, one mnemonic at a tim…assembly languageA low-level programming language that uses human-readable mnemonics (like ADD, MOV, JMP) as a th…assignmentThe operation that writes a new value into the memory cell bound to a variable. In TypeScript/Ja…asymptoticDescribing how a function behaves as its argument grows toward infinity, ignoring constant facto…asyncShort for asynchronous. The approach where a program sends a request to a slow device and, inste…at-least-onceA message-delivery guarantee that ensures every message is delivered to the consumer at least on…at-most-onceA message-delivery guarantee where a message is sent once and never retried, so it is delivered…aud claimThe aud claim in a JWT (RFC 7519) identifies the intended recipients of the token — typically a…authoritativeAn authoritative DNS server holds the definitive zone records for a domain and answers queries d…authorization codeA short-lived, single-use code returned by the authorization server to the client's redirect URI…auto_explain.sample_rateThe fraction of statements the auto_explain extension logs plans for — used to capture slow-quer…autovacuumPostgreSQL's background daemon that automatically runs VACUUM and ANALYZE on tables, reclaiming…auxiliary spaceThe extra memory used by an algorithm beyond the input itself: new arrays, temporary variables,…

B

backend_xminThe oldest transaction ID that a PostgreSQL backend's current snapshot still considers potential…backhaulThe aggregation link between edge access points — cell towers, Wi-Fi base stations, remote offic…backtrackingA recursive technique that explores all candidate solutions by building them incrementally: choo…bandwidth-delay productThe product of a link's bandwidth and the round-trip time (RTT), measured in bytes: BDP = bandwi…base addressThe byte address of an array's first cell — the fixed anchor the array name refers to. Every ele…base caseThe condition in a recursive function that stops recursion and returns a result directly, withou…baseline profileAn Android performance artifact that lists classes and methods to be compiled Ahead-of-Time by t…basic operationThe single representative step counted when analysing an algorithm's cost — for example, the com…batchLoadFnThe user-supplied function passed to DataLoader's constructor that receives an array of keys acc…bearer tokenAn access credential defined in RFC 6750 where possession alone grants access — no cryptographic…Bellman-FordA shortest-path algorithm that relaxes all edges V-1 times, running in O(V*E). It handles negati…BGPBorder Gateway Protocol: the path-vector routing protocol that exchanges reachability between au…Big-O notationA mathematical notation that expresses an upper bound on how an algorithm's time or space grows…binaryRelating to a system with exactly two states or symbols (0 and 1). Computer hardware uses binary…binary heapA complete binary tree kept in an array where every parent satisfies the heap order against its…binary searchA search algorithm that operates on a sorted array by repeatedly comparing the target with the m…binary search tree (BST)A binary tree in which, for every node, all values in the left subtree are smaller than the node…binding (variable)The association between a variable name and the memory address of the cell that holds its value.…binomial coefficientThe mathematical expression C(n, k) = n! / (k!(n-k)!), read as 'n choose k', which counts the nu…bitThe smallest unit of data in a computer: a single binary digit that can hold exactly two values,…bit manipulationOperating directly on the individual bits of a number instead of its decimal value, using six bi…bit patternA specific sequence of 0s and 1s occupying a contiguous set of bits in memory. A bit pattern by…bloatThe wasted disk space that accumulates in a PostgreSQL table or index when MVCC dead tuples are…blocking callA call that does not return until its work is finished. When the work is a slow device, the call…booleanA value that can only be true (1) or false (0) — a single bit interpreted as a truth value. Name…boolean (JS)The JavaScript primitive type with exactly two values: true and false. Represents a single binar…branch mispredictionA branch misprediction occurs when the CPU's branch predictor guesses the wrong path, forcing th…branch predictionBranch prediction is a CPU mechanism that guesses the outcome of a conditional branch before it…branching factorIn a recursion tree, the number of recursive calls made by a single function invocation. For exa…breadth-first search (BFS)A graph traversal that visits all vertices at distance d from the source before any at distance…Brian Kernighan's algorithmA method for counting set bits: n &= n - 1 clears the lowest set bit, so looping until n reaches…bubble sortA comparison-based sorting algorithm that repeatedly passes through the array, swapping adjacent…bucketA container (list or slot) in a hash map or hash table where items are stored after hashing. Mul…build-heapThe procedure that turns an unordered array into a heap by sifting down every non-leaf node, fro…bytecodeA compact, platform-neutral intermediate binary representation produced by compiling source code…Byzantine fault toleranceA class of failure in which a node behaves arbitrarily — sending conflicting, incorrect, or mali…

C

cableBroadband internet delivered over the coaxial (HFC) infrastructure originally built for cable TV…cacheA store that remembers the result of a computation so a repeat request can read the saved answer…cache hitA request that the cache satisfies from a stored copy without contacting the origin. The hit rat…cache keyThe identifier a cache uses to look up a stored response — typically composed of the request URL…cache lineThe fixed-size unit of data transferred between main memory and a CPU cache — commonly 64 bytes…cache localityThe degree to which a program's memory accesses cluster in space and time, determining how effec…cache missA request the cache cannot satisfy because the data is absent, expired, or invalidated, forcing…cache stampedeA failure pattern where a popular cache entry expires and many concurrent requests simultaneousl…Cache-ControlAn HTTP response (and request) header that directs caches how long and under what conditions a r…call stackThe memory area where function calls store their local variables and return addresses. Each recu…callbackA function handed to a non-blocking call with the instruction to run it when the result is ready…candidateIn Raft consensus, a candidate is a server that has timed out waiting for heartbeats from the cu…candidate solutionA potential complete solution being built during backtracking. Initially partial, it may or may…CAP theoremA fundamental theorem in distributed systems proving that a system can guarantee at most two out…CDNContent Delivery Network: a geographically distributed set of edge servers that cache and serve…certificateAn X.509 data structure that binds a public key to an identity (domain, organization, or person)…chaining (separate chaining)A collision resolution technique where each bucket stores a linked list of key–value pairs. When…characterA single letter, digit, punctuation mark, or space in a string. Each character has a code (e.g.,…character codeThe numeric value representing a character, typically ASCII (0–127) or Unicode (0–1,114,111). Us…choose-explore-undoThe core pattern of backtracking: (1) choose a value or branch, (2) recurse (explore) deeper wit…cipher suiteA named combination of algorithms — key exchange, authentication, bulk encryption, and MAC — tha…circuit (logic)A network of logic gates connected so that the output of one gate feeds the input of another. A…circuit breakerA resilience pattern that wraps calls to an external dependency and tracks failure rate. When fa…circular bufferA fixed-size array treated as a ring: two pointers (front and rear) wrap around using modulo, el…client_credentials grantAn OAuth 2.0 grant type (RFC 6749 §4.4) where a confidential client authenticates directly with…client_secretA shared secret issued by the authorization server to a confidential client at registration, use…clog_buffersHow many CLOG pages PostgreSQL caches in shared memory; too few causes disk I/O during visibilit…co-locationPlacing services or components that communicate frequently on the same host, rack, or data-centr…code_challengeThe value sent to the authorization endpoint in a PKCE flow (RFC 7636): a Base64URL-encoded SHA-…code_verifierA high-entropy random string (43-128 characters, RFC 7636) generated by the client at the start…coding gainThe reduction in the required signal-to-noise ratio (in dB) that an error-correcting or data-com…collisionA hash collision occurs when two distinct keys produce the same hash value and therefore map to…combinationA selection of k items from a set of n items where order does not matter. {A, B} and {B, A} are…commit indexIn the Raft consensus algorithm, the highest log entry index the leader knows to be safely repli…commit log (CLOG)PostgreSQL's transaction-status log (pg_xact/): two bits per transaction id recording committed…compilerA program that reads source code in a high-level language and translates the whole program into…complementIn two-sum, the complement of a number x (given target t) is t - x. If x + complement = target,…complete binary treeA binary tree where all levels are completely filled except possibly the last, which is filled f…complexity scoringA GraphQL server-side technique that assigns a numeric cost to each field in a query's AST befor…compositeIn browser rendering, a composite layer is a portion of a page that the browser promotes to its…compositor layerA separate GPU-backed surface the browser promotes for an element when it needs to be composited…compositor threadA dedicated browser thread that composites rasterized layers into the final frame and handles in…concatenationJoining two or more sequences — strings, arrays, or byte buffers — end-to-end to form a single s…concurrencyDealing with many tasks by interleaving them on a single core: the tasks take turns and only one…congestion controlTCP's mechanism for preventing network collapse by adjusting how much data is in flight. It star…congestion windowA sender-side TCP variable (cwnd) that caps the number of unacknowledged bytes allowed in flight…connectedDescribes an undirected graph in which there is a path between every pair of vertices, so it for…connected componentA maximal group of vertices in an undirected graph in which every pair is joined by a path, with…connected graphAn undirected graph where a path exists between every pair of vertices. A directed graph with th…connection migrationA QUIC feature that allows an existing connection to survive a change in the client's IP address…connection stormA connection storm is a failure mode where a large number of clients simultaneously attempt to e…consensusA distributed-systems problem in which a cluster of nodes must agree on a single value despite n…consent screenThe UI screen shown by the authorization server where the resource owner explicitly approves the…const declarationA variable declaration using the `const` keyword that seals the binding — the variable cannot be…constant timeAn operation that takes O(1) time regardless of input size — the number of steps is bounded by a…constraintA rule or condition that restricts the valid values or states in a system. In databases, constra…consumer groupA named set of Kafka consumers that jointly consume a topic, with each partition assigned to exa…consumer rebalancingIn Kafka, the process by which the group coordinator reassigns topic partitions across the activ…contiguous memoryContiguous memory is a block of memory addresses where elements are stored consecutively with no…continuous profilingThe practice of collecting CPU, memory, and other profiling data from production services contin…coreOne complete fetch–decode–execute engine inside a processor. A core executes exactly one instruc…correctnessA property of an algorithm or program that guarantees it produces the right output for every val…crashThe controlled termination of a program by the runtime when an exception is raised and no handle…crash-fault-tolerant (CFT)A property of a distributed system that lets it continue operating correctly when some nodes cra…CRLiteA Mozilla scheme that compresses the full set of WebPKI certificate revocations into a compact f…CSSOMCSS Object Model: a browser API that represents parsed stylesheets and computed styles as JavaSc…cum-time (cumulative)In sampling profilers such as pprof and Python's cProfile, the cumulative time attributed to a f…cursor-based paginationA pagination strategy that uses an opaque cursor — typically the last row's ID or a composite so…cycleA path that starts and ends at the same vertex, traversing at least one edge, without repeating…

D

datagramA self-contained, independently routed packet that carries enough addressing information to be d…DataLoaderA utility library (originally by Facebook) that coalesces individual .load(key) calls made durin…dead-letter queue (DLQ)A secondary queue in a messaging system that receives messages the primary queue could not deliv…deadlockA cycle in the lock-wait graph where each transaction holds a resource another is waiting for, s…DebeziumAn open-source platform of Kafka Connect source connectors that implements log-based change data…debuggingThe disciplined process of locating the cause of incorrect program behaviour. Because the machin…declaration (variable)The statement that reserves a memory cell and establishes the name-to-address binding for a vari…decorrelated jitterA retry-backoff strategy in which each wait interval is chosen uniformly at random between a bas…degreeThe number of edges incident to a vertex. In a directed graph, in-degree is edges pointing to th…delivery semanticsThe contract a messaging system makes about how many times a consumer receives each message. The…deoptimization (deopt)The process where V8 discards optimized machine code for a function and falls back to executing…depth limitA GraphQL server guard that inspects the query AST before execution and rejects any query whose…depth-first search (DFS)A graph traversal that follows each edge as far as possible before backtracking, visiting every…dequeDouble-ended queue: a data structure where insertion and deletion occur at both ends (front and…dequeueTo remove and return the element at the front of a queue. In a FIFO queue, dequeue removes the o…deterministicA property of a process whose output is fully determined by its input and starting state: given…device code flowAn OAuth 2.0 grant type (RFC 8628) for input-constrained devices such as smart TVs. The device d…diameterThe length of the longest path between any two nodes of a tree, measured in edges. The path may…digitOne of the ten symbols 0-9 that numbers are written with.Dijkstra's algorithmAn algorithm for shortest paths from a source in a weighted graph with non-negative edge weights…directedDescribes a graph whose edges are one-way: an edge A → B can be traversed only from A to B. Such…directed acyclic graph (DAG)A directed graph with no cycle. A topological order exists if and only if the graph is a DAG, wh…directed graphA graph where edges have a direction: an edge (u,v) points from u to v. Also called a digraph. C…divide and conquerAn algorithm design paradigm that recursively splits a problem into smaller subproblems of the s…DLQ (dead-letter queue)Abbreviation for dead-letter queue. In practice, DLQ also names the specific AWS SQS and Azure S…DLQ redriveAn Amazon SQS operation that moves messages from a dead-letter queue back to a source queue (or…DNS queryA client request to resolve a hostname to an IP address. The OS / local client resolver forwards…DNSSECA suite of IETF extensions (RFC 4033–4035) that adds cryptographic signatures to DNS records. Ea…DoHDNS over HTTPS (RFC 8484): tunnels DNS queries inside HTTPS on port 443, hiding them from on-pat…DOMDocument Object Model: a tree of nodes the browser constructs from parsed HTML, where each eleme…dominant termThe term in a cost expression that grows fastest and therefore determines the Big-O class once l…DoQDNS over QUIC (RFC 9250): carries DNS queries directly over QUIC streams on port 853, combining…DoTDNS over TLS (DoT, RFC 7858): a protocol that wraps DNS queries inside a TLS connection on port…double-ended queueA queue where insertion and deletion occur at both ends (front and rear). Same as a deque. Requi…doubly linked listA linked list whose nodes hold two pointers, one to the next node and one to the previous. This…dp arrayThe table a tabulated DP fills in, where each cell holds the answer to one subproblem (for examp…DPoPDemonstrating Proof of Possession (RFC 9449): an OAuth 2.0 mechanism that sender-constrains acce…DSCPDifferentiated Services Code Point: a 6-bit field in the IP header (RFC 2474) that marks a packe…dual-write problemThe problem that arises when a service must write to two separate systems — for example a databa…duplicate detectionThe process of identifying records, messages, or requests that have already been processed. Comm…dynamic arrayA resizable array that doubles its allocated capacity when full, copying elements to a new block…dynamic programming (DP)A technique that solves a problem by breaking it into overlapping subproblems and storing each a…dynamic typingA type discipline where the type of a value is tracked at run time by the runtime itself (not at…

E

earliest finish timeThe sort key for interval scheduling (activity selection): sort intervals by end time and take e…early exitStopping a loop or function as soon as the answer is known, without processing remaining element…eBPFA Linux kernel subsystem that allows sandboxed programs to run safely in kernel space without mo…ECDHEElliptic-Curve Diffie-Hellman Ephemeral: a key-agreement algorithm used in TLS where both sides…ECHEncrypted Client Hello (RFC 9849): a TLS 1.3 extension that encrypts the inner ClientHello — inc…ECMPEqual-Cost Multi-Path routing: when the routing table contains multiple next-hops for the same d…edgeA connection between two vertices of a graph. It may be directed (one-way) or undirected, and ma…edge caseAn input or state that lies at the extreme boundary of valid input space — empty collections, ze…edge workerA short-lived compute function executed inside a CDN point-of-presence rather than in a central…edit distanceThe minimum number of single-character insert, delete, or replace operations needed to turn one…effectively-onceAn end-to-end processing guarantee achieved by combining at-least-once delivery with idempotent…Election SafetyA Raft safety property stating that at most one leader can be elected in any given term. It is e…election timeoutIn Raft, the interval a follower waits without receiving a heartbeat before declaring itself a c…element sizeThe fixed number of bytes one array element occupies. Because every element of an array shares o…encapsulationAn object-oriented principle that bundles data and the methods that operate on it into a single…encodingA shared convention that assigns meaning to a bit pattern. The same sequence of bits can represe…enqueueTo add an element to the rear of a queue. In a FIFO queue, enqueue inserts the new element at th…error conditionA situation a program reaches that it cannot continue past with its normal logic — a missing fil…escape analysisA compiler analysis that proves an object never leaves the function that created it — so it can…ESIEdge Side Includes: an XML-based markup language (W3C submission, 2001) that lets a CDN or rever…event loopThe mechanism that runs callbacks: a callback queue plus a loop that, whenever the call stack is…exactly-onceA delivery guarantee that each message is received and processed by the consumer exactly one tim…exactly-once processingAn application-level guarantee that each input message causes exactly one state change or side-e…exceptionThe runtime mechanism that responds when an error is raised: it stops normal control flow — the…exception handlerA block of code written to catch a raised exception and recover from it — in JavaScript, a catch…exchange argumentA proof technique for greedy algorithms: take any optimal solution and show you can swap its fir…expand-contract migrationA three-phase zero-downtime schema change pattern: expand (add new columns/tables alongside old…exponential backoffA retry strategy where the wait time before each successive attempt doubles (or grows by a fixed…exponential outputA problem property where the number of valid outputs grows as 2ⁿ with input size n — generating…exponential timeA time complexity class where running time grows as c^n for some constant c > 1, most commonly O…extract minimumA priority queue operation that removes and returns the element with the smallest (or in extract…

F

factorial outputThe output of a factorial calculation: n! = n × (n−1) × … × 1. Factorial values grow faster than…factorial timeA time complexity class O(n!) where the number of operations grows as the factorial of the input…false sharingFalse sharing occurs when two or more CPU cores repeatedly modify independent variables that hap…FAPI 2.0Financial-grade API 2.0: an OpenID Foundation security profile built on OAuth 2.0 and OIDC, desi…farthest reachIn the greedy jump-style problem, the single number tracked during a left-to-right sweep: the fa…fast and slow pointersA two-pointer technique (Floyd's cycle detection / tortoise-and-hare) where a slow pointer advan…FCP (first contentful paint)First Contentful Paint: a browser performance metric that records the time from navigation start…feasibility checkA test that determines whether a candidate solution satisfies all constraints before committing…FeedbackVectorA per-function array V8 allocates to record runtime type feedback — one slot per IC site (proper…fencing tokenA monotonically increasing token number issued by a lock service each time a client acquires a d…fetch waterfallA performance pattern where multiple network requests are issued sequentially — each waiting for…FIBA Fibonacci number is a member of the sequence defined by F(0)=0, F(1)=1, F(n)=F(n−1)+F(n−2): 0,…fiberA transmission medium made of thin glass or plastic strands that carry data as pulses of light u…fieldA named slot inside an object, also called a property. A field is a key-value pair: the key is t…FIFOFirst In, First Out: an ordering discipline where the element inserted earliest is the first to…fillfactorA storage parameter setting how full a page may get before a new one is allocated; values below…firewallA network security device that inspects packets and enforces a policy of allow or deny. Stateles…flame graphA stack-trace visualization invented by Brendan Gregg in which sampled call stacks are merged an…flood fillBFS or DFS run on a grid to visit every cell of a connected region, named after paint-bucket too…followerIn Raft, a passive cluster member that accepts log entries from the leader and applies them to i…forced synchronous layoutA browser performance problem where JavaScript reads a layout property (e.g. offsetWidth, getBou…forward error correctionForward error correction: a technique where the sender adds redundant packets derived from sourc…forward secrecyA property of a key-agreement protocol whereby a compromise of the server's long-term private ke…forwarding tableA data structure in a router's forwarding plane (also called FIB, Forwarding Information Base) t…frameA single rendered image in the browser's display pipeline, produced once per refresh cycle (16.6…frequency countingThe pattern of counting how many times each value appears in a dataset using a hash map. One O(n…frequency mapA hash map where keys are values from the input and counts (integers) are the values. Built in o…from_collapse_limitHow many subquery items the planner will flatten into the parent query's join tree before leavin…frontA pointer to the first (oldest) element in a queue. Dequeue operations remove from the front. In…full jitterA retry backoff strategy where the delay before each attempt is drawn uniformly at random from z…functional dependencies (extended statistics)An extended-statistics object telling the planner that one column's value determines another's,…

G

garbage collectionAutomatic memory management performed by a runtime system: the garbage collector (GC) periodical…generic planA prepared-statement plan compiled once, parameter-agnostic, and reused for every execution — tr…GeoDNSA DNS technique where the authoritative server returns different A/AAAA records based on the geo…GEQO (genetic query optimizer)PostgreSQL's heuristic join-ordering strategy: for queries with many joins it uses a genetic/evo…geqo_thresholdThe join count at which PostgreSQL switches from exhaustive join-order search to the genetic opt…graphA collection of vertices (nodes) connected by edges, written as a pair (V, E). Unlike a tree, a…GraphQLA query language for APIs and a server-side runtime, originally developed at Facebook, where the…GraphQL introspectionA built-in GraphQL mechanism that lets clients query the schema itself using meta-fields __schem…GraphQL resolverA function attached to a GraphQL schema field that returns the field's value when a query is exe…GREASEGenerate Random Extensions And Sustain Extensibility (RFC 8701): a technique where TLS clients a…greater thanOne number is greater than another when it sits further right on the number line. Written with t…greedy algorithmAn algorithm that builds a solution one piece at a time, taking the locally best choice at each…group keyA computed value assigned to each item in a grouping operation; items that compute the same key…groupingA hash-map pattern where the value is a list (not a count): for each item, compute a group key,…growth rateThe asymptotic rate at which an algorithm's resource cost (time or space) increases as input siz…

H

Hamming weightThe number of bits equal to 1 in a number's binary representation, also called its population co…handshakeAn initial exchange of messages between two parties that establishes a shared context before dat…happens-beforeA formal ordering guarantee between two operations: if A happens-before B, then B is guaranteed…hardware performance counterA hardware register inside the CPU's Performance Monitoring Unit (PMU) that counts low-level mic…hardware prefetcherA dedicated hardware unit inside the CPU that monitors memory access patterns and speculatively…hash functionA deterministic function that maps an arbitrary key to a fixed-range integer (the hash code), us…hash mapA hash-table-backed key-value store that supports average O(1) insert, lookup, and delete. Unlik…hash setA hash-table-backed collection of unique keys with no associated values, supporting average O(1)…hash tableA data structure that maps keys to values by applying a hash function to derive an array index,…headThe first node in a linked list. All traversal starts from the head, since there is no backward…headerA named key-value metadata field transmitted at the start of an HTTP request or response, separa…header compressionThe technique of reducing the size of HTTP headers sent on the wire. In HTTP/1.1 headers are pla…heapPostgreSQL's row-oriented table storage: rows live in 8 KB pages with tuple headers, a null bitm…heap propertyThe rule that makes a binary tree a valid heap: every parent is less than or equal to its childr…heapifyAnother name for the build-heap procedure: converting an unordered array into a valid heap in pl…heartbeatA periodic message a node sends to signal that it is still alive. In Raft the leader broadcasts…height-balancedDescribes a tree in which, for every node, the heights of the left and right subtrees differ by…hidden class (Map/Shape)An internal V8 structure (called Map in V8 source, Shape in SpiderMonkey) that describes an obje…high-level languageA programming language that abstracts over the details of a specific CPU — its registers, instru…HKDFHMAC-based Extract-and-Expand Key Derivation Function (RFC 5869): a two-step KDF that first extr…HNSWHierarchical Navigable Small World — an index for vector similarity search with logarithmic look…hot shardA shard in a distributed database or cache that receives disproportionately more traffic than it…HOT update (heap-only tuple)A PostgreSQL optimization that avoids writing a new index entry when an UPDATE does not change a…hotspotA region of code where a disproportionately large fraction of CPU samples or execution time is c…HPACKThe header compression format for HTTP/2 (RFC 7541). HPACK maintains a static table of 61 common…HPKPHTTP Public Key Pinning (RFC 7469): a now-removed browser security header that let a server decl…HSMHardware Security Module: a tamper-resistant physical device that generates, stores, and uses cr…HSTSHTTP Strict Transport Security (RFC 6797): a response header (Strict-Transport-Security) that in…HTTP frameThe basic unit of communication in HTTP/2 (RFC 9113): a 9-byte header (3 bytes length, 1 byte ty…HTTPS recordA DNS resource record type (RFC 9460) that publishes HTTPS connection parameters — supported ALP…hybrid logical clock (HLC)A timestamp combining a logical counter with wall-clock time, giving distributed nodes a consist…hydrationThe client-side process where a JavaScript framework (React, Vue, etc.) attaches event listeners…hydration mismatchAn error that occurs during hydration when the HTML the browser received from the server differs…hypothesisIn debugging, a specific, testable claim about where a program's behaviour diverged from what wa…

I

ICMPInternet Control Message Protocol (RFC 792): a companion to IP that carries error and diagnostic…id_tokenA signed JWT defined by OpenID Connect that an authorization server returns alongside an access…idempotencyThe property of an operation that produces the same result whether applied once or multiple time…Idempotency-KeyA unique client-supplied token — typically a UUID — sent in the Idempotency-Key HTTP header on a…idempotent producerA message producer that guarantees each logical message is written to a log or queue exactly onc…idle_in_transaction_session_timeoutA setting that terminates a session holding a transaction open but doing nothing — preventing it…Ignition (V8 interpreter)V8's bytecode interpreter, first enabled in V8 5.3 / Chrome 53 (for low-memory Android devices)…immutableA value or object whose state cannot be changed after creation. Immutable data eliminates a clas…implicit grant (removed)A former OAuth 2.0 flow in which the authorization server returned an access token directly in t…implicit graphA graph that is never built as an adjacency list or matrix: its neighbors are computed on the fl…in placeA property of an algorithm that transforms its input using only a constant (O(1)) or at most O(l…in-degreeThe number of edges pointing into a vertex of a directed graph. In dependency terms it counts th…in-place changeA modification that overwrites an existing memory cell at the same address, replacing its conten…in-place sortA sorting algorithm that rearranges elements within the original array using O(1) or O(log n) ex…inbox patternA consumer-side deduplication pattern where a service persists an incoming event's unique ID to…indexAn auxiliary data structure — most commonly a B-tree — maintained alongside a table to speed up…indirectionStoring the address of a value rather than the value itself, so a cell points at the data instea…inline cache (IC)A per-call-site optimization where V8 caches the hidden class it last saw and the corresponding…input and outputThe data supplied to a program (input) and the data it produces (output). Precise definition of…input boundA lower bound on algorithm complexity determined by the size of the input itself: any algorithm…insertTo add an element to a priority queue. In a binary heap, insert() adds the element at the end an…insertion sortA comparison-based sorting algorithm that builds the sorted result one element at a time by shif…InstallSnapshotA Raft RPC the leader uses to transfer a complete state-machine snapshot to a follower that has…instrumentation profilerA profiler that injects timing probes into every function entry and exit point at compile time o…integer overflowWhat happens when an arithmetic result is too large to fit in the fixed number of bits a type re…interface vs implementationThe two sides of an abstraction. The interface is the visible surface a user depends on — for a…interpreterA program that reads and executes source code (or bytecode) statement by statement at run time,…interval DPA dynamic program whose state is a contiguous slice of the input: dp[i][j] is the best answer fo…invariantA condition that is true before and after every step of an algorithm. Each operation is written…IPC (instructions per cycle)Instructions per cycle: the average number of instructions a CPU core retires in one clock cycle…IsEmptyThe operation that reports whether a priority queue or heap holds no elements. With an array-bac…ISN (Initial Sequence Number)Initial Sequence Number: the 32-bit value a TCP endpoint picks for its first byte when opening a…isolation levelA setting that controls how much a transaction is shielded from concurrent changes made by other…ISR (Incremental Static Regeneration)A Next.js rendering strategy that serves a pre-built static page instantly and regenerates it in…iss claimIn OIDC and OAuth 2.0, the issuer is the case-sensitive HTTPS URL that uniquely identifies an au…iterationOne pass through a loop body. If a loop runs 10 times, it performs 10 iterations. In array trave…

J

JA3A TLS client fingerprinting method created at Salesforce in 2017 that extracts selected numeric…JA4A TLS client fingerprinting suite developed by FoxIO as the successor to JA3, using a sortable a…JAR (RFC 9101)JWT-Secured Authorization Request (JAR, RFC 9101): an OAuth 2.0 extension that packages authoriz…JIT (just-in-time compilation)A hybrid execution strategy in which the runtime compiles frequently executed bytecode or interp…JIT compilationPostgreSQL compiles expression evaluation in scan, join, and aggregate nodes to machine code at…JIT warmupThe ramp-up period after a JavaScript process starts during which functions execute in the inter…jitterRandom variation added to a retry delay to prevent synchronized bursts. Without jitter, every cl…join_collapse_limitThe join count above which the planner stops reordering explicit JOINs and (with geqo_threshold)…joint consensusThe Raft mechanism for safely changing cluster membership. When transitioning from configuration…JWKSJSON Web Key Set: a JSON document containing an array of public keys (each in JWK format) that a…JWTJSON Web Token (RFC 7519): a compact, URL-safe token format that encodes a set of claims as a JS…

K

k-th largest elementThe element that would sit at position k if the values were sorted in descending order. A min-he…Kafka idempotent producerA Kafka producer configured with enable.idempotence=true that receives a unique producer ID (PID…Kafka transactionsA Kafka feature (introduced in KIP-98) that lets a producer write to multiple partitions atomica…Kahn's algorithmA topological sort that computes every vertex's in-degree, enqueues all in-degree-0 vertices, th…Keep-AliveAn HTTP or TCP mechanism that holds a connection open between requests, avoiding the cost of a n…key-value pairA key together with the value stored under it. An object is a collection of key-value pairs: eac…KIP-98Kafka Improvement Proposal 98, merged in Kafka 0.11.0, which introduced the two primitives that…kTLSKernel TLS (kTLS): a Linux kernel feature that moves TLS record encryption and decryption from u…

L

L1 cacheThe first and fastest level in the CPU cache hierarchy, private to each core. L1 is split into a…L2 cacheThe second level of the CPU cache hierarchy, sitting between L1 and L3. L2 is larger and slower…L3 cacheThe last level of on-die CPU cache, shared across all cores on the same socket. L3 is the larges…latencyThe time elapsed from initiating an operation to receiving its result — for example, from sendin…layoutThe browser pipeline step that computes the exact position and size of every visible element by…layout thrashA performance failure where JavaScript alternates reading and writing geometry properties within…lazy deletionA trick for heaps without decrease-key: instead of updating an entry, push a duplicate with the…LCP (Largest Contentful Paint)Largest Contentful Paint: a Core Web Vital that measures the render time of the largest visible…Leader Append-OnlyA Raft safety property: a leader never overwrites or deletes entries in its own log — it only ap…Leader CompletenessA Raft safety property: if a log entry is committed in a given term, it is present in the logs o…leader leaseA time-bounded agreement among a Raft majority that the current leader remains the only leader f…leaky abstractionAn abstraction that fails to fully hide the layer below it, so implementation detail becomes vis…learner (non-voting)A Raft cluster member that receives replicated log entries from the leader but does not count to…left shift (<<)The bitwise operator that slides bits to the left, filling with zeros on the right. 1 << 3 = 100…less thanOne number is less than another when it sits further left on the number line. Written with the <…let declarationA variable declaration using the `let` keyword that reserves a memory cell, names it, and allows…libpqPostgreSQL's C client library implementing the frontend/backend wire protocol; psql, PgBouncer,…LIFOLast In, First Out: the ordering rule where the element added most recently is the first one rem…linear data structureA data structure whose elements are arranged in a single sequence, each one coming before or aft…linear timeA time complexity class O(n) where the number of operations grows proportionally to the input si…linked listA sequential data structure where elements are stored in nodes, each holding a value and a point…linkerA tool that combines multiple object files and library archives into a single executable binary.…list depthThe maximum nesting level of a recursive list structure. A flat list has depth 1; each additiona…load factorIn a hash table, the ratio of items to buckets: α = count / size. Higher load factors lead to lo…loader (OS loader)The operating-system component that reads an executable file from disk, creates a new process wi…local scopeThe scope that is limited to a single function body. A variable declared inside a function has l…local variableA variable declared inside a function body. Its scope is limited to that function body, and its…locally best choiceThe option that looks best at the current step, taken without looking ahead. A greedy algorithm…Log MatchingA Raft safety property composed of two guarantees: (1) if two log entries in different servers h…logarithmic timeA time complexity class O(log n) where each step reduces the remaining problem size by a constan…logic gateA hardware component that computes one boolean operation. Built from transistors, it takes one o…logical ANDA boolean operation that returns true (1) if and only if both inputs are true (1); returns false…logical NOTA boolean operation that takes one input and returns its inverse: NOT 1 = 0, NOT 0 = 1. Also cal…logical ORA boolean operation that returns true (1) if at least one input is true (1); returns false (0) o…logical replicationStreaming row-level changes (not raw disk blocks) from one PostgreSQL database to another; the b…Long Animation Frames (LoAF)The Long Animation Frames API — a PerformanceObserver entry (Chromium, 2023+) reporting any fram…longest common subsequence (LCS)The longest sequence of characters that appears, in order but not necessarily adjacent, in both…longest increasing subsequence (LIS)The longest strictly increasing subsequence of an array. A one-dimensional DP solves it in O(n²)…loop invariantA property that holds true before every iteration of a loop and is preserved by each iteration.…lost updateA concurrency anomaly where two transactions read the same value, each computes an update indepe…lower boundIn a sorted array, the first index whose value is greater than or equal to a given x, found by b…

M

macrobenchmarkA benchmark that measures end-to-end performance of complete user flows — startup time, scroll f…Maglev (V8 mid-tier JIT)V8's mid-tier optimizing JIT compiler, sitting between Sparkplug (fast baseline) and TurboFan (s…max-heapA heap where the parent node is always greater than or equal to its children. The root always co…maxReceiveCountAn Amazon SQS redrive policy setting that controls how many times a consumer may receive a messa…megamorphic ICAn inline-cache state reached when a call site has seen more than four distinct object shapes. V…memcache leaseA mechanism introduced in Facebook's Memcached deployment (NSDI 2013) to prevent two cache patho…memoizationThe top-down way to write dynamic programming: take the natural recursive solution and add a cac…memory cellThe smallest individually addressable unit of RAM, typically one byte (8 bits). Each cell has a…mergeThe combine step of merge sort: given two sorted subarrays, produce a single sorted array by rep…merge sortA divide-and-conquer sorting algorithm that recursively splits an array into halves, sorts each…MESI cache coherencyA cache coherency protocol used in multi-core CPUs to keep private L1/L2 caches consistent. Each…metastable failureA self-sustaining system collapse where a transient trigger (e.g. a traffic spike or a cache flu…methodA function that is stored as a field of an object and operates on the data of that same object.…microbenchmarkA benchmark that measures the performance of a single isolated function or code block, deliberat…min-heapA heap where the parent node is always less than or equal to its children. The root always conta…min-priority-queueA priority queue that always removes the element with the smallest key first, typically implemen…ML-KEMModule-Lattice-Based Key-Encapsulation Mechanism (NIST FIPS 203, 2024): a post-quantum KEM deriv…mnemonicA short, human-readable abbreviation that stands for a machine-code operation in assembly langua…modulationThe process of encoding information onto a carrier signal by varying one or more of its properti…moduleA unit of code that groups related definitions behind a boundary. A module exposes a public inte…monomorphic ICAn inline-cache state where a call site has seen exactly one object shape. V8 caches the single…monotonic predicateA boolean function f(x) that changes value at most once as x increases — either from false to tr…monotonic stackA stack where elements are maintained in sorted order (increasing or decreasing) by removing ele…most common values (MCV)A statistic storing a column's most frequent values and their frequencies, sharpening selectivit…MSSMaximum Segment Size: a TCP option exchanged in SYN segments that advertises the largest payload…mTLS-bound tokens (RFC 8705)Certificate-bound access tokens (RFC 8705): an OAuth 2.0 mechanism that binds an access token to…MTUMaximum Transmission Unit: the largest IP datagram, in bytes, that a network link can carry with…Multi-PaxosAn optimization of basic Paxos for replicating a sequence of commands. A stable leader runs Phas…Multi-RaftAn architecture in which a single process runs many independent Raft consensus groups simultaneo…multiplexingA technique for sending multiple independent logical channels over a single shared physical link…MultiXactPostgreSQL's mechanism for tracking a row locked by multiple transactions at once (e.g. SELECT .…MultiXact IDA 32-bit id stored in a tuple's xmax when several transactions hold a shared lock on the row; it…must-stapleOCSP Must-Staple (RFC 7633): an X.509 v3 certificate extension that requires the TLS server to i…mutationAn in-place change to an existing memory cell: an assignment that overwrites the bit pattern at…MVCCMulti-Version Concurrency Control: each writer creates a new row version and each transaction re…

N

n_distinctA per-column statistic estimating the number of distinct values; it drives row-count estimates a…N+1 problemA data-access anti-pattern where code executes one query to fetch a list of N items and then N a…nameserverA DNS server that holds the authoritative records for a zone and answers queries about hostnames…natural numberA counting number: 1, 2, 3, and so on.NDNeighbor Discovery (RFC 4861): the IPv6 protocol that replaces ARP and ICMP Router Discovery. No…negative cachingStoring the fact that a lookup produced no result, so subsequent identical queries are answered…neighbor (adjacent vertex)A vertex v is a neighbor of u if an edge exists between them. In a directed graph, v is a neighb…next greater elementFor each element in an array, the next element to its right that is larger than it. If no such e…next pointerA field in a node that stores the memory address of the next node in a linked list. The last nod…nodeA single unit in a linked list. Contains a value and a pointer to the next node. The first node…non-blocking callA call to a slow device that does not wait for the work to finish. It hands the request to the d…nonceA number used once: a random value included in a cryptographic protocol to guarantee that each m…NOT (~)The unary bitwise operator that flips every bit, including the high bits that are usually not sh…null (JS)The JavaScript primitive value representing deliberate absence of any object or value. Distinct…NUMAA multiprocessor memory design where each CPU socket has its own local memory, and accessing mem…number (JS)The JavaScript primitive type for all numeric values, stored as a 64-bit IEEE 754 double-precisi…

O

O(log n) timeTime complexity where each step halves (or reduces by a constant factor) the remaining problem s…OAuth 2.1OAuth 2.1 (IETF draft): a consolidation of OAuth 2.0 (RFC 6749) and its security best practices…object fileThe output of compiling or assembling a single source file. An object file contains machine-code…object referenceA value stored in a variable's memory cell that is the heap address of an object, not the object…observer effectThe distortion of a program's performance characteristics caused by the act of measuring it: ins…OCSPOnline Certificate Status Protocol (RFC 6960): a protocol for checking the revocation status of…off-CPU profileA profile that records time a thread spends off the CPU — blocked on I/O, locks, page faults, or…offsetHow many bytes past a base address a piece of data begins. For an array element, the offset equa…one-dimensional DPA dynamic program whose state is a single index i, usually a position in an array or string. The…OpenID ConnectOpenID Connect: an identity layer on top of OAuth 2.0 that adds user authentication to OAuth's a…operation batchingA GraphQL transport technique where the client sends multiple operations in a single HTTP reques…operations per secondA throughput metric counting how many discrete operations a system completes in one second. Used…opposite endsA two-pointer pattern where one pointer starts at index 0 and the other at the last index, then…optimal substructureThe property that after making a safe first choice, the rest of the problem is a smaller instanc…optimistic updateA UI pattern where the client applies a state change immediately — before the server confirms —…OR (|)The bitwise operator whose result bit is 1 if either input bit is 1. Used to set bits: 1100 | 10…origin shieldAn intermediate CDN caching tier placed between edge PoPs and the origin server. When multiple e…Orinoco GCThe codename for V8's modern garbage collector, which replaced a stop-the-world design with para…outbox patternWrite a domain change and an event row to an outbox table in one transaction; an async worker la…overwriteTo replace the current bit pattern in a memory cell with a new value, destroying the previous co…

P

PACELC theoremAn extension of the CAP theorem proposed by Daniel Abadi to describe distributed system trade-of…packetA unit of data routed through a network, consisting of a header containing control fields (sourc…paintThe browser pipeline step that converts the layout tree into a list of drawing commands (a displ…PAR (RFC 9126)Pushed Authorization Request (RFC 9126): an OAuth 2.0 extension where the client sends the full…parallelismMany tasks literally running at the same instant, which requires multiple cores — one instructio…parameterA named variable declared in a function signature that receives its value from the caller's argu…partial solutionAn incomplete candidate solution being built during backtracking—it may satisfy some constraints…partitionA subroutine in quicksort that rearranges elements in a subarray so that all elements smaller th…pass-by-valueA calling convention where the argument's value is copied into the callee's stack frame as a par…pathA sequence of vertices where consecutive vertices are connected by edges. A simple path visits e…PaxosA family of protocols for reaching consensus in a cluster of crash-prone nodes, introduced by Le…peekTo view the highest-priority element without removing it from a priority queue. In a binary heap…perf_event_openA Linux system call that opens a file descriptor for a hardware or software performance event on…PerformanceLongTaskTimingA PerformanceObserver entry type that reports any main-thread task longer than 50 ms — the brows…permutationAn ordered arrangement of all elements of a set. A set of n distinct elements has n! permutation…persisted queriesA GraphQL security and performance technique where operation strings are pre-registered on the s…PFS (Perfect Forward Secrecy)Perfect Forward Secrecy: the same property as forward secrecy — a compromise of the server's lon…pg_repackA PostgreSQL extension that removes table and index bloat online by copying rows to a shadow tab…PgBouncerA lightweight connection pooler that multiplexes thousands of client connections onto a small se…PGO (profile-guided optimisation)Profile-guided optimisation (PGO) is a compiler technique that feeds runtime execution data from…phantom readA SQL-standard concurrency anomaly where a transaction re-executes a range query and finds rows…pipeliningAn HTTP/1.1 feature that allows a client to send multiple requests on a persistent TCP connectio…pivotAn element selected from a subarray to drive the partition step in quicksort. After partitioning…PKCEProof Key for Code Exchange (RFC 7636): an OAuth 2.0 extension that defends against authorizatio…place valueThe value a digit carries because of where it sits in a number: the same digit means ones, tens,…PMTUDPath MTU Discovery (RFC 1191 for IPv4, RFC 1981 for IPv6): a mechanism that finds the smallest M…pointerA value that stores the location (memory address) of another piece of data instead of the data i…poison pillA message that a consumer can never process successfully, causing it to crash or throw on every…polymorphic ICAn inline-cache state where a call site has seen between two and four distinct object shapes. V8…polymorphic inliningInlining a called function directly at the call site when the engine has seen a small, fixed set…POPPoint of Presence: a physical CDN or cloud facility housing edge servers, routers, and interconn…post-orderThe order in which DFS finishes vertices: a vertex is recorded only after all of its outgoing ed…postgres_fdwA foreign-data-wrapper extension that lets one PostgreSQL query tables in a remote PostgreSQL in…postmasterThe supervisor process of a PostgreSQL instance: it listens for connections, forks a backend pro…power setThe set of all subsets of a given set, including the empty set and the set itself. A set of n el…pprofpprof is Google's profiling data format (a gzip-compressed protocol buffer) and the accompanying…pre-voteA Raft extension that adds a phase before a real election: a candidate first checks whether a ma…precomputationComputing a result once in advance and storing it for later reuse, trading upfront time and spac…predicate lockAn SIREAD lock acquired by PostgreSQL's SSI engine on every tuple, page, or relation a serializa…prefetchA technique where a cache line is loaded into CPU cache before the processor explicitly requests…prefix arrayAn array where each element at index i stores the cumulative sum (or other aggregate) of element…prefix sumA technique where an array is preprocessed in O(n) time so that the sum of any contiguous subarr…premature optimisationKnuth's warning (1974): "premature optimization is the root of all evil" — spending engineering…preprocessingA one-time computation over input data that builds an auxiliary structure, trading upfront time…primitive copyThe behaviour when a primitive value is assigned to a variable: the actual bit pattern is copied…primitive typeA type representing a single, indivisible value that cannot be decomposed into smaller typed par…priority queueAn abstract data type that stores elements and allows extraction of the element with the highest…procarrayA shared-memory array of all active backend processes; backends read it to build an MVCC snapsho…profileA profile is a dataset that records where a program spends resources — CPU cycles, memory alloca…program stateThe complete collection of current values held by all live variables at a specific instant durin…pruningIn backtracking, the act of identifying when a partial solution cannot lead to a valid answer an…PSKPre-Shared Key: a symmetric key distributed to communicating parties out of band before the sess…pushThe heap operation that adds a new element: append it at the end of the array in O(1), then sift…PyroscopePyroscope (now Grafana Pyroscope) is an open-source continuous profiling database that stores CP…

Q

QAMQuadrature Amplitude Modulation: a digital modulation scheme that encodes data by varying both t…QPACKQPACK (RFC 9204): the header compression format used in HTTP/3, replacing HPACK. Unlike HPACK wh…quadratic timeAn algorithm runs in quadratic time, O(n²), when doubling the input size roughly quadruples the…query costAn arbitrary unitless number the PostgreSQL planner assigns to each execution plan node, anchore…queueA data structure that stores elements in first-in, first-out (FIFO) order: add elements to the b…QUICQUIC (RFC 9000): a general-purpose transport protocol built on UDP that integrates TLS 1.3 encry…quicksortA divide-and-conquer sorting algorithm that picks a pivot, partitions the array into elements le…quorumThe minimum number of nodes in a distributed system that must acknowledge an operation for it to…

R

radioA wireless physical-layer link that carries data as modulated electromagnetic waves over a radio…RaftA consensus algorithm designed explicitly for understandability, introduced by Ongaro and Ouster…raise an exceptionTo trigger the exception mechanism in response to a detected error condition. "Raise" and "throw…range queryA question about a contiguous range of elements, such as 'what is the sum of elements from index…rasterThe step where the browser executes paint commands to produce actual pixel bitmaps for each comp…React DevTools ProfilerA panel in the React DevTools browser extension that records each render commit with per-compone…React Server Components (RSC)React Server Components: a React architecture where components marked without "use client" run e…React SuspenseA React component that wraps a subtree and renders a fallback UI while any child component is no…READ COMMITTEDThe default PostgreSQL isolation level. Each statement within a transaction takes a fresh snapsh…ReadIndexA Raft optimization that allows the leader to serve linearizable reads without writing a log ent…rearA pointer to the last (most recently added) element in a queue. Enqueue operations add to the re…recurrenceThe formula that expresses dp[i] in terms of earlier cells, such as dp[i-1] and dp[i-2]. It is t…recursionWhen a function calls itself to solve a smaller version of the same problem. Requires a base cas…recursion treeA tree diagram where each node represents a single function call, edges represent call relations…recursive caseThe part of a recursive function that calls itself on a smaller input, making progress toward th…recursive resolverA DNS server that accepts a query from a client, walks the DNS delegation hierarchy on the clien…redirect_uriThe URI to which the OAuth authorization server redirects the user-agent after authorization, ca…reference semanticsThe assignment behaviour for objects and arrays: the variable's cell receives a copy of the refe…reflowAn older WebKit and Gecko name for the layout step: the browser recalculates every affected elem…refresh tokenA long-lived credential issued alongside an access token that allows a client to obtain a new ac…refresh token rotationRefresh token rotation: a security policy where each use of a refresh token immediately invalida…relaxThe operation applied to an edge (u, v) with weight w: if dist[u] + w < dist[v], lower dist[v] t…relaxed memory modelA concurrency model where threads may observe memory writes in different orders unless explicit…render treeA tree the browser constructs by combining the DOM and CSSOM, retaining only the visible nodes e…repaintA browser rendering cycle triggered when a visual property changes but element geometry is unaff…REPEATABLE READA PostgreSQL isolation level where a transaction takes a single snapshot at the start of its fir…replay attackAn attack in which a valid, previously captured message or credential is retransmitted to deceiv…replicated state machineAn architecture where each node in a cluster maintains an identical state machine driven by the…request coalescingA general CDN and proxy behaviour where concurrent cache-miss requests for the same URL at one e…request collapsing (Fastly)Fastly's name for the same deduplication behaviour: when a cacheable object is being fetched fro…request fingerprintA compact hash or signature derived from a set of observable request attributes — IP address, Us…RequestVoteThe Raft RPC sent by a candidate to solicit votes during an election. The message carries the ca…resolverA DNS server that receives queries from stub resolvers on end-user devices and resolves them to…resolver lookaheadA GraphQL resolver optimization where a resolver inspects the query AST via the info argument to…Resource Indicators (RFC 8707)An OAuth 2.0 extension (RFC 8707) that adds a resource parameter to authorization and token requ…retransmissionTCP resending a segment that was not acknowledged within the retransmission timeout (RTO). TCP d…retransmitTo resend a TCP segment that was not acknowledged. The sender retransmits when the retransmissio…retry budgetA resilience policy that caps the total rate of retries a service may emit as a fraction of the…retry stormA failure mode where many clients simultaneously retry failed requests against a recovering serv…Retry-AfterAn HTTP response header that tells a client how long to wait before retrying a request. Used wit…return valueThe value produced by a function and handed back to the caller when the function's return statem…RGBRed-Green-Blue colour encoding. Each pixel stores three intensity values — one per channel — typ…right shift (>>)The bitwise operator that slides bits to the right. 1101 >> 1 = 110 (decimal 6); each shift by o…rolling arrayA space optimization for DP that keeps only the rows the recurrence still needs (typically the c…routerA Layer 3 network device that forwards IP packets between networks. For each arriving packet, th…routing tableA data structure in a router that maps destination IP prefixes to next-hop addresses and outgoin…row estimate disasterA query plan failure caused by the PostgreSQL planner grossly misjudging the number of rows a no…row-level security (RLS)PostgreSQL policies that filter which rows a role may read or write — an in-database alternative…RRSIGRRSIG (Resource Record Signature): a DNSSEC record that holds the digital signature for an RRset…RSC PayloadThe serialized React Flight wire format that a React Server Components framework streams from se…RTTRound-trip time: the elapsed time from sending a packet to receiving its acknowledgment. RTT dri…RUM (real user monitoring)Real User Monitoring (RUM) collects performance and error data from actual browser or mobile ses…runtime systemThe support infrastructure that a language implementation provides alongside a compiled or inter…

S

sampling (audio)The process of measuring a continuous signal (typically air pressure for audio) at discrete, equ…sampling profilerA sampling profiler measures program behavior by periodically interrupting execution — typically…Scavenger (V8 young-gen GC)V8's parallel young-generation garbage collector, part of the Orinoco GC. It runs a semispace co…scopeThe region of source code in which a name (variable, parameter, function) is visible and usable.…sea-of-nodes IRA graph-based compiler intermediate representation where data and control dependencies are nodes…search spaceThe subset of elements currently being searched or considered. Binary search repeatedly halves t…seen setA hash set that stores values encountered while traversing data. For each new value, check if so…SELECT FOR UPDATEA PostgreSQL SELECT clause that acquires an exclusive row-level lock on each returned row, block…selection sortAn in-place sorting algorithm that repeatedly finds the minimum element in the unsorted portion…self-timeIn sampling profilers such as pprof and cProfile, the self time (flat time) of a function is the…sender-constrained tokensA property of an access token that cryptographically binds it to the client that requested it, r…sequence numberA 32-bit field in a TCP segment (RFC 793) that labels the first byte of payload data in that seg…SERIALIZABLEThe strictest SQL isolation level, guaranteeing that concurrent transactions produce the same re…serialization failure (SQLSTATE 40001)An error (SQLSTATE 40001) PostgreSQL raises when SSI or REPEATABLE READ detects that committing…Server FunctionAn async function marked with the 'use server' directive that executes exclusively on the server…Server PushAn HTTP/2 feature where the server sends a PUSH_PROMISE frame announcing a resource, then delive…session ticketA TLS session resumption mechanism in which the server encrypts the session state and sends it t…SETNXA Redis command (SET if Not eXists) that writes a key only when it is absent, returning 1 on suc…settle invariantThe core of Dijkstra's correctness proof: when a vertex is popped as the minimum, its tentative…shared_buffersPostgreSQL's main in-memory cache of table and index pages, shared by all backends; its size sha…shared-tenant proxyA reverse proxy that serves multiple independent tenants from the same infrastructure — terminat…short circuitStopping evaluation as soon as the result is determined. Example: `arr.some(x => x < 0)` stops a…shortest pathThe path from a source to a target with the smallest total length: the fewest edges in an unweig…shortest path in a weighted graphIn a weighted graph a path's length is the sum of its edge weights, not the number of edges, so…shortest path in an unweighted graphIn an unweighted graph a path's length is its number of edges, so the shortest path is the one w…sift-downA heap operation that restores the heap property after the root is replaced: the misplaced eleme…sift-upA heap operation that restores the heap property after an insertion: the new element, placed at…signal-to-noise ratioIn observability and alerting, signal-to-noise ratio describes the proportion of actionable, mea…SIMDA CPU instruction-set feature that applies one operation to multiple data elements packed into a…single-flightA concurrency pattern, canonically implemented in Go's golang.org/x/sync/singleflight package, t…sliding windowAn algorithm technique that maintains a contiguous range of elements — the window — and advances…Smi (small integer)In the V8 JavaScript engine, a Smi (small integer) is an integer in the 31-bit signed range (32-…snapshotA consistent, point-in-time view of data captured at a specific moment. In MVCC databases a snap…snapshot isolationA concurrency control method where each transaction reads from a consistent snapshot taken at it…SNIServer Name Indication (RFC 6066): a TLS extension in which the client includes the target hostn…SoA (structure of arrays)Structure of Arrays: a memory layout where each field of a record type is stored in its own cont…sortedA collection is sorted when every element satisfies the ordering relation with its successor — f…sorted arrayAn array arranged in non-decreasing order (or non-increasing, depending on the sort direction).…sortingThe process of rearranging the elements of a collection so that they satisfy a total order — typ…source mapA file mapping minified production code back to original source lines, so a stack trace or profi…space complexityA function describing how much extra memory an algorithm uses as input size n grows. Expressed i…Sparkplug (V8 baseline JIT)V8's non-optimizing baseline JIT compiler, sitting between Ignition (interpreter) and Maglev (mi…specificationA precise, implementation-independent description of what a system, protocol, or interface must…SPIFFESecure Production Identity Framework for Everyone: an open standard for issuing cryptographic wo…SPIRESPIFFE Runtime Environment: the reference implementation of the SPIFFE specification. A SPIRE Se…split brainA failure mode in a distributed cluster where a network partition causes two or more subsets of…SQS visibility timeoutAn Amazon SQS parameter that controls how long a message remains invisible to other consumers af…SSA (Static Single Assignment)A compiler intermediate-representation form where every variable is assigned exactly once, makin…SSG (Static Site Generation)A rendering strategy where pages are compiled to static HTML, CSS, and JavaScript at build time…SSI (Serializable Snapshot Isolation)Serializable Snapshot Isolation — the algorithm behind PostgreSQL's SERIALIZABLE level since ver…SSR (Server-Side Rendering)A rendering strategy where the server generates a complete HTML document for each incoming reque…stable sortA sorting algorithm is stable if it preserves the original relative order of elements that compa…stackA linear data structure where every insertion (push) and removal (pop) happens at one end, the t…stack frameThe block of call-stack memory allocated for a single function invocation, holding that call's l…stack overflowA runtime error that occurs when a program exhausts the fixed-size call stack, most often becaus…stack traceA snapshot of the call stack at the moment an exception is raised: the ordered list of frames fr…stack unwindingThe runtime's walk down the call stack after an exception is raised: starting from the frame tha…stacking contextAn element whose descendants paint together as one self-contained z-order group; that group as a…stale-if-errorA Cache-Control extension (RFC 5861) that allows a cache to serve a stale stored response when t…stale-while-revalidateA Cache-Control extension (RFC 5861) and HTTP caching strategy: the cache serves a stale respons…standard libraryThe collection of built-in functions, data structures, and modules that ships with a programming…start indexIn combination/permutation backtracking, a parameter that controls which elements can be conside…stateWhat dp[i] means, stated in one precise sentence: the question each cell answers. Choosing the s…stateThe set of arguments that fully describes a subproblem, and so the key of the memoization cache.…state machineA computational model that transitions between a finite set of states in response to inputs. In…State Machine SafetyA Raft safety property (Figure 3 of the Raft paper): if a server has applied a log entry at a gi…state paramThe state parameter in an OAuth 2.0 authorization request (RFC 6749 §4.1.1): an opaque random va…stateful programA program that stores values across multiple steps and modifies them over time, so its behaviour…statefulnessThe property of a service that retains client context between requests — session data, in-flight…stateless resetA QUIC mechanism (RFC 9000 §10.3) that lets an endpoint terminate a connection even after losing…static typingA type discipline where the type of every variable is known at compile time. The compiler checks…STEK (Session Ticket Encryption Key)Session Ticket Encryption Key: the symmetric key a TLS server uses to encrypt and authenticate s…step countThe step count of an algorithm is the number of primitive operations — assignments, comparisons,…store operationA CPU instruction that writes a value from a register into a memory cell at a specified address.…streamA sequence of data elements — bytes, events, or records — made available incrementally over time…stream-level loss isolationA QUIC property whereby a lost packet stalls only the stream it belongs to, leaving all other st…strictly increasingDescribes a sequence in which each element is strictly greater than the previous one, so equal n…stringA sequence of characters treated as a single value. In most high-level languages strings are len…string (JS)The JavaScript primitive type representing a sequence of Unicode code points. Stored internally…style recalcThe browser pipeline step in which the engine matches every CSS selector against every affected…sub claimThe subject claim in a JWT or OIDC token: a string that uniquely identifies the principal (typic…subarrayA contiguous slice of an array defined by a start and end index, containing only elements that a…subgraphAn independently deployed GraphQL service that owns a slice of the federated schema in Apollo Fe…subintervalA slice [i..j] of the input, treated as one subproblem in interval DP. Its answer dp[i][j] is bu…subsequenceA sequence obtained by deleting some elements from an array or string without reordering the res…subsetSet A is a subset of set B (written A ⊆ B) if every element of A is also in B. The empty set is…subset sumThe boolean specialization of 0/1 knapsack: can some subset of the given numbers add up to an ex…supergraphThe unified GraphQL schema produced by composing multiple Apollo Federation subgraphs. It is not…SVCB recordSVCB (Service Binding) record: a DNS resource record type (RFC 9460) that publishes connection p…swapExchange the values of two variables or array elements in place: [a, b] = [b, a]. Used in revers…SWR libraryA React data-fetching library by Vercel whose name is derived from stale-while-revalidate. The u…SYNThe TCP segment flag that initiates a connection. A client opens a TCP connection by sending a s…SYN cookiesA defense against SYN-flood attacks (RFC 4987) in which the server encodes connection state into…synchronousThe approach where a program sends a request to a slow device and then stops and waits for the a…

T

t_xmaxA system column in every PostgreSQL heap tuple that holds the transaction ID of the transaction…t_xminA system column in every PostgreSQL heap tuple that holds the transaction ID of the INSERT or UP…tabulationThe bottom-up way to write dynamic programming: build a dp array, fill the base cases, then loop…TanStack QueryA framework-agnostic server-state library (also known as React Query) for TypeScript/JavaScript…TCP segmentThe Protocol Data Unit (PDU) of TCP: a header plus a payload of application bytes. The 20-byte m…term (Raft)In Raft, a monotonically increasing integer that acts as a logical clock and election epoch. Eac…TFO (TCP Fast Open)TCP Fast Open (RFC 7413): an extension that allows a client to include application data in the S…threadA single, ordered stream of instructions being executed — one program counter advancing through…throughputThe volume of work a system completes per unit of time — for example, requests per second or byt…thundering herdA failure mode where a large number of processes or requests simultaneously contend for the same…time budgetA time budget is a maximum allowed execution time assigned to a task, request, or rendering phas…time–space tradeoffA choice where an algorithm can reduce time by using more memory, or reduce memory by taking mor…TimeoutNowA Raft RPC used to transfer leadership to a designated follower. The current leader first brings…TLB (translation lookaside buffer)An MMU cache that stores recent virtual-to-physical address translations. Modern CPUs use a mult…TLDTop-level domain: the rightmost label in a domain name, appearing after the last dot (e.g., .com…TLSTransport Layer Security: the cryptographic protocol that secures most Internet traffic. A TLS h…token introspectionOAuth 2.0 Token Introspection (RFC 7662): an endpoint a resource server calls to ask the authori…topThe single end of a stack where all insertions and deletions happen. The element at the top is t…topological orderA linear arrangement of all vertices of a directed graph such that for every edge u → v, u appea…transaction-mode poolA PgBouncer pooling mode where a server connection is assigned to a client only for the duration…transactional outboxA pattern that solves the dual-write problem: instead of writing to a database and publishing to…traversalThe act of visiting every element in a data structure (array, list, tree) in a specific order, u…treeA connected graph with no cycles: V vertices and exactly V-1 edges, with exactly one path betwee…tree depthThe length of the longest path from root to leaf in a tree. In a recursion tree, depth equals th…tri-color markingA garbage-collection marking scheme that partitions objects into white (unreached), grey (reache…trusted documentsA GraphQL security technique where the server maintains an allowlist of pre-approved operation d…truth tableA table listing every possible combination of inputs to a boolean operation and the output it pr…TTFB (time-to-first-byte)Time To First Byte: the elapsed time from a browser sending an HTTP request to receiving the fir…TTLTTL (time to live) bounds how long data stays valid. For a cached entry or DNS record it is a ti…TTL jitterA caching technique that adds a random offset to a cache entry's TTL so that entries populated a…tupleIn PostgreSQL, a single physical row version stored in a heap file. Each tuple carries a header…TurboFan (V8 optimising JIT)V8's top-tier optimizing JIT compiler. It reads Ignition's type-feedback vectors and compiles by…Two Generals' ProblemA thought experiment proving that it is impossible to achieve guaranteed agreement over an unrel…two pointersAn algorithm technique that uses two index variables moving through an array or string — either…two sumA classic problem: find two numbers in an array that add up to a target. The naive solution is O…two-dimensional DPA dynamic program whose subproblem needs two indices, so the state is dp[i][j] and the cache is…typeAn interpretation rule for a bit pattern: it specifies how many bytes the value occupies and how…type errorA detected mismatch between the type rule used to store a value and the type rule applied when r…type interpretationThe act of applying a type rule to a bit pattern to produce a meaningful value. The same bit pat…type ruleThe specification of how a bit pattern should be decoded: its size in bytes and the algorithm fo…type safetyThe property of a program or language system that prevents bits from being read with a different…typeofA JavaScript/TypeScript unary operator that returns a string naming the type of its operand at r…

U

undefined (JS)The JavaScript primitive value assigned automatically to a declared-but-not-yet-assigned variabl…undefined behaviourA program operation for which the language gives no guaranteed result — reading past the end of…undirectedDescribes a graph whose edges are symmetric: an edge (A, B) can be traversed from A to B and fro…undirected graphA graph where edges have no direction: edge (u,v) is the same as (v,u). Each edge is bidirection…UnicodeA universal character standard that assigns a unique code point (written U+XXXX) to every charac…Union-Find (Disjoint Set Union)A data structure that maintains a partition of elements into disjoint sets as a parent[] forest,…unique grid pathsThe classic 2D DP that counts routes from the top-left to the bottom-right of a grid moving only…unweightedDescribes a graph whose edges carry no value: an edge either exists or it does not, so a path's…

V

V8Google's JavaScript engine, used in Chrome and Node.js. It parses, compiles, optimises, and runs…V8 IsolateA self-contained V8 instance with its own heap, garbage collector, and compilation pipeline. Mul…VACUUMA PostgreSQL maintenance command that scans table pages, marks dead tuple slots as reusable, and…VACUUM FULLA PostgreSQL variant of VACUUM that rewrites the entire table and all its indexes into new files…valueAt the machine level: a pattern of bits stored in one or more consecutive memory cells. At the l…value in memoryA value considered as a concrete bit pattern at a specific address in RAM. Contrasted with the a…value semanticsThe assignment behaviour for primitive types: the actual bit pattern of the value is copied into…variableA named memory cell (or group of cells) whose contents can be read and updated. Consists of two…variable nameThe source-code identifier used to refer to a variable, such as 'score' or 'count'. The name is…variable valueThe bit pattern currently stored in the memory cell bound to a variable. Distinct from the varia…Vary headerAn HTTP response header that lists the request headers a cache must consider when looking up a s…vertex (node)A fundamental unit of a graph, representing an entity. A graph consists of vertices connected by…virtual machine (VM)A software program that emulates a simplified computer — the 'virtual' CPU. Bytecode languages c…visibility mapA per-table bitmap marking pages where every tuple is visible to all transactions, letting index…visited setA set (or boolean array) recording which vertices a traversal has already reached. Checking it b…vsyncThe display's hardware refresh signal — one tick every ~16.67 ms at 60 Hz. The browser aims to c…

W

WAL (write-ahead log)PostgreSQL's sequential on-disk log (stored in pg_wal/) where every change is recorded before th…wall-clock timeThe elapsed real time a process or operation takes from start to finish, as measured by an exter…weightThe number attached to an edge of a weighted graph, representing a cost, distance, or capacity.…weightedDescribes a graph whose edges each carry a numeric weight, such as a cost, distance, or capacity…weighted edgeAn edge with an associated numeric value (weight), representing cost, distance, or strength. Con…will-changeA CSS property that hints to the browser which properties of an element are likely to change, so…windowIn TCP, the receive window is the amount of buffer space a receiver advertises in each ACK segme…wireThe physical or logical transmission medium over which encoded bytes travel between two endpoint…worst caseThe worst case of an algorithm is the specific input (or class of inputs) of a given size that m…write pointerAn index that marks where the next element to keep should be written during an in-place array mo…write skewA concurrency anomaly that arises under snapshot isolation but is not one of the three SQL-stand…write-ahead logging (WAL)Every change is appended to a sequential log before the data pages are written, so an interrupte…

X

X25519MLKEM768A hybrid TLS 1.3 key exchange group that concatenates a classical X25519 ECDHE share with an ML-…XFetchA probabilistic early-expiration algorithm that prevents cache stampedes without locks. Each rea…XID wraparoundPostgreSQL transaction ids are 32-bit and eventually wrap; if old rows are not frozen by VACUUM…xmin horizonThe oldest transaction ID still needed for visibility by any active transaction, replication slo…XOR (^)The bitwise operator whose result bit is 1 only if the input bits differ. Used to toggle bits an…

Y

Yuasa snapshot-at-the-beginningA concurrent-GC technique that preserves the object graph as it was at the start of marking — so…
shortcutsexpand
search
⌘K
prev piece
k
next piece
j
cycle tier
t
this menu
?