Glossary

#

11 terms

A

46 terms

B

25 terms
  • B-tree

    The structure databases use most to store records and look them up by key. It keeps keys in order, which makes lookups and range queries fast, and divides the database into fixed-size pages that it can overwrite where they lie.

    First used in
    Horizontal sharding and consistent hashing
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 4: B-Trees
  • back queue

    In Mercator’s URL frontier, one of the FIFO queues of its back end, which is responsible for politeness. Each is nonempty and holds the URLs of only one host; a table maps hosts to back queues, and a heap records when each queue’s web server may be contacted again.

    Also called
    back-end queue
    Taught in
    The URL frontier and politeness
    Source
  • backend

    The part of a web application that runs on servers and handles users' requests, as opposed to the code that runs in the web browser.

    First used in
    Response time versus throughput
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 1: Terminology: Frontends and Backends
  • backpressure

    Making a sender slow down when its recipient cannot keep up, for example by blocking the producer, which lets a queue apply backpressure upstream, or by sending responses that ask clients to slow down.

    Also called
    flow control
    Taught in
    Backpressure, queue lag and dead-letter queues
    Source
    • Designing Data-Intensive Applications, 2nd edition, glossary
    • Release It!, 2nd edition, chapter 5: Create Back Pressure
    • Designing Data-Intensive Applications, 2nd edition, chapter 2: When an Overloaded System Won't Recover
  • backup and restore

    The disaster recovery strategy at the low-cost, low-complexity end: making backups. It is a suitable approach for mitigating data loss or corruption, and can also be used against a disaster in a Region, by replicating the data to other AWS Regions.

    Taught in
    Multiple regions and disaster recovery
    Source
  • bandwidth

    The maximum rate at which data can be sent over a communication channel. It is often misused for the rate being sent at the moment, which is throughput.

    First used in
    Performance versus scalability
    Source
    • Systems Performance, 2nd edition, glossary
  • BASE

    basically available, soft state, eventual consistency

    A name sometimes given to systems that do not meet the ACID criteria. It is even less precise than ACID: about the only sensible reading of it is "not ACID".

    Taught in
    NoSQL data models and access patterns
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 8: The Meaning of ACID
  • Base64

    An encoding that represents any sequence of bytes as text, six bits to a character, in an alphabet that uses letters in both cases as well as + and /. Its characters that are not letters or digits, / in particular, may cause problems in file names and URLs.

    Taught in
    Step 3: Core components
    Source
  • batch (of requests to a model)

    Requests a model server processes together. A decode step still makes one token for each request, but makes them for all of them at once, doing more calculation for each reading of the weights.

    Taught in
    Batching and the KV cache
    Source
    • Hands-On LLM Serving and Optimization, 1st edition, chapter 6: Why Do We Need Batching in Real-Time Serving?
  • batch processing

    A computation that takes a fixed, usually large, set of data as its input and produces other data as its output, leaving the input unchanged.

    Also called
    batch job
    First used in
    Step 2: A high level design
    Source
    • Designing Data-Intensive Applications, 2nd edition, glossary
  • benchmark

    A tool that runs a workload as an experiment and measures its performance.

    First used in
    Denormalization and SQL tuning
    Source
    • Systems Performance, 2nd edition, glossary
  • BFS

  • BGP

    Border Gateway Protocol

    The Internet's core routing protocol, between the networks it is made of: each BGP system tells the others which networks can be reached through it. It judges a path mainly by its number of hops, not by its latency.

    First used in
    DNS and global traffic routing
    Source
    • IETF RFC
    • Understanding Distributed Systems, 2nd edition, chapter 15: Overlay network
  • BigQuery

    Google Cloud’s data warehouse, one of the newer ones that run only in the cloud.

    Also called
    Google BigQuery
    First used in
    Step 4: Scale the design
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 4: Cloud Data Warehouses
  • Bigtable

    Google's database that made the wide-column data model popular.

    First used in
    NoSQL data models and access patterns
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 3: Data locality for reads and writes
  • binlog

    MySQL's log of events that describe changes to the database, such as changes to table data. With row-based replication, MySQL keeps it as its replication log, in addition to its write-ahead log.

    Also called
    binary log
    Taught in
    Single-leader and multi-leader replication
    Source
    • MySQL documentation
    • Designing Data-Intensive Applications, 2nd edition, chapter 6: Logical (row-based) log replication
  • Bloom filter

    A fast but approximate check of whether a key is in a set. When it says no, the key is certainly absent; when it says yes, the key is probably present. LSM-trees often keep one per SSTable, to skip the files that cannot hold a key.

    Taught in
    Storage engines: B-trees versus LSM-trees
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 4: Bloom filters
  • bottleneck

    The resource that limits a system's performance. Finding and removing bottlenecks is a key part of performance work.

    First used in
    Performance versus scalability
    Source
    • Systems Performance, 2nd edition, chapter 2: 2.1 Terminology
  • branch mispredict

    A wrong guess by the processor. At a conditional branch the code goes one way or another depending on a test, so the processor guesses the outcome and starts on it; when the guess proves wrong, that work is thrown away, which hurts performance.

    Also called
    mispredict
    First used in
    Back-of-the-envelope estimation
    Source
    • Systems Performance, 2nd edition, chapter 6: 6.3.3 Instruction Pipeline
  • breadth-first search

    A way of searching a graph that looks at all of a vertex’s neighbors before going on to any of those neighbors’ own neighbors. The vertices farthest out are searched last, and the search is typically built with a queue.

    Taught in
    Graph traversal and bidirectional BFS
    Source
  • brute force

    Getting in by trying one combination of password after another.

    First used in
    Reverse proxies and edge security
    Source
  • buffer pool

    The part of a database that keeps pages read from disk in memory, so that reading them again need not go to disk.

    First used in
    Single-leader and multi-leader replication
    Source
    • Database Internals, 1st edition, chapter 5: Buffer Management
  • bulkhead

    Splitting a system into separate parts, as a ship is divided into watertight compartments, so that a failure in one part can be kept from destroying the rest. Physical redundancy is the most common form; separate groups of threads inside one process are another.

    Taught in
    Circuit breakers, retries and bulkheads
    Source
    • Release It!, 2nd edition, chapter 5: Bulkheads
  • byte

    A unit of digital data: eight bits, each bit a zero or a one.

    First used in
    Response time versus throughput
    Source
    • Systems Performance, 2nd edition, glossary
  • Byzantine fault

    A fault in which a node behaves wrongly in an arbitrary way, for example by sending other nodes contradictory or malicious messages.

    Also called
    Byzantine, Byzantine failure
    Taught in
    Consensus and leader election: Raft and Paxos
    Source
    • Designing Data-Intensive Applications, 2nd edition, glossary

C

70 terms

D

34 terms

E

24 terms

F

21 terms

G

15 terms

H

30 terms

I

29 terms

J

7 terms

K

10 terms
  • Kafka

    A persistent event bus that combines a message queue with a distributed log: events stay in the log until the space runs out.

    Also called
    Apache Kafka
    First used in
    Partition keys, skew and polyglot persistence
    Source
    • Release It!, 2nd edition, chapter 16: Messages, Events, and Commands
  • Kappa architecture

    An approach, sometimes known by this name, in which batch computations, which reprocess past data, and stream computations, which handle events as they come in, can be implemented in one system. That needs the ability to replay past events through the same engine that handles the recent ones.

    Taught in
    Stream processing versus batch recomputation
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 13: Unifying batch and stream processing
  • KB

    kilobyte

    In computing, usually 1,024 bytes. The International System of Units makes a kilobyte 1,000 bytes.

    First used in
    Back-of-the-envelope estimation
    Source
    • Systems Performance, 2nd edition, glossary
  • Ketama

    A library that maps keys to servers, written to replace how its authors’ Memcached clients did it. It hashes each server to several numbers, conceptually placed on a circle, and each key to one number, owned by the server of the next number after it. Adding or removing a server then moves only a small share of keys.

    Also called
    libketama
    Taught in
    Partitioning: consistent hashing and hash slots
    Source
  • key-range sharding

    Sharding in which each shard holds every partition key between a lowest and a highest value, like the volumes of a paper encyclopedia. Range scans are easy, but you can easily get a hot shard when there are many writes to nearby keys.

    Also called
    range sharding, range-based sharding, range partitioning
    Taught in
    Horizontal sharding and consistent hashing
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 7: Sharding by Key Range
  • key-value store

    A data store that maps each key to a value. In its pure form it treats both as bytes it does not interpret; Dynamo, for one, offers simple reads and writes of an item identified by its key.

    Also called
    key-value
    Taught in
    NoSQL data models and access patterns
    Source
  • key/value head

    A key and value head of a model’s attention. In the original design each query needs one of its own; with grouped-query attention, a group of query heads shares one.

    Also called
    KV head
    Taught in
    Batching and the KV cache
    Source
    • Hands-On LLM Serving and Optimization, 1st edition, chapter 6: Scalable Attention Mechanisms
  • KGS

    key generation service

    Taught in
    Short links: Base62, MD5 and a key service
  • KMS

    AWS Key Management Service

    An AWS service that protects its users’ root keys. Everything done with its KMS keys, from creating them to using and deleting them, happens inside it, and they never leave it unencrypted. To use or manage one, a caller calls AWS KMS.

    Also called
    AWS KMS
    First used in
    Credential vaults and envelope encryption
    Source
  • KV cache

    key-value cache

    The attention keys and values a model has computed at each layer for earlier tokens, stored so that decoding skips computing them again: more memory for less computation. Space for it is kept in GPU memory beside the weights, and it grows with longer prompts and longer answers.

    Also called
    KV
    Taught in
    Batching and the KV cache
    Source
    • Hands-On LLM Serving and Optimization, 1st edition, chapter 2: Chapter 2. Large Language Model Serving
    • Hands-On LLM Serving and Optimization, 1st edition, chapter 2: Enable the KV Cache to Boost Performance
    • Hands-On LLM Serving and Optimization, 1st edition, chapter 5: Estimating KV Cache Size

L

41 terms
  • L/C

  • L1

    level 1 cache

    The first of a CPU's caches for main memory: very fast, but small.

    First used in
    Back-of-the-envelope estimation
    Source
    • Systems Performance, 2nd edition, chapter 2: 2.3.14 Caching
  • L2

    level 2 cache

    The second level of a CPU's caches for main memory: larger than level 1, and slower to reach.

    First used in
    Back-of-the-envelope estimation
    Source
    • Systems Performance, 2nd edition, chapter 2: 2.3.14 Caching
  • L4

    layer 4

    The transport layer of the network stack, where TCP runs. A layer 4 load balancer works at this level: it generally looks at addresses and ports, not at what the packets carry.

    Also called
    transport layer
    Taught in
    Load balancing: layer 4 versus layer 7
    Source
  • L7

    layer 7

    The application layer of the network stack, where HTTP runs. A layer 7 load balancer is an HTTP reverse proxy: it reads each request and sends it to a server of its choice.

    Also called
    application layer
    Taught in
    Load balancing: layer 4 versus layer 7
    Source
    • Understanding Distributed Systems, 2nd edition, chapter 18: Application layer load balancing
    • AWS documentation
  • Lambda architecture

    An early proposal for bringing batch processing and stream processing together. It had several problems, and has fallen out of use.

    Taught in
    Stream processing versus batch recomputation
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 13: Unifying batch and stream processing
  • LAN

    local area network

    A group of computers and other devices in a fairly small area, such as a building, linked so that any of them can talk to any other.

    First used in
    Load balancing: layer 4 versus layer 7
    Source
  • language model

    A model holding statistics about one or more languages: the chance of each word in a given context. Given a text, the prompt, it tries to complete it.

    Taught in
    How a model answers a request
    Source
    • AI Engineering, 1st edition, chapter 1: Language models
  • last write wins

    Resolving conflicting writes by keeping the one with the greatest timestamp and discarding the others. When writes are concurrent, which one counts as last is in effect random, so writes can be lost.

    Also called
    LWW
    Taught in
    Single-leader and multi-leader replication
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 6: Last write wins (discarding concurrent writes)
    • Designing Data-Intensive Applications, 2nd edition, chapter 9: Timestamps for ordering events
  • latency

    Waiting time: the part of a request's life when nothing is working on it, such as a queueing delay or time crossing the network. Sometimes used to mean the whole response time.

    Taught in
    Response time versus throughput
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 2: Latency and Response Time
  • latency-based routing

    A DNS routing policy for resources in several regions: each query is answered with the region that gives the best latency.

    Also called
    latency routing
    Taught in
    DNS and global traffic routing
    Source
  • leader (in TAO)

    In TAO, the cache server in a region’s leader tier that hosts a shard. All writes to the shard go through it, it reads from and writes to the database, and it sends refills and invalidations to the followers asynchronously.

    Also called
    leader cache, leader tier
    Taught in
    Graph partitioning and the TAO cache
    Also means
    leader (replication)
    Source
  • leader (replication)

    When data is copied across several nodes, the one replica allowed to make changes. Also called the primary, or the source; Redis calls it the master.

    Also called
    master
    First used in
    Scaling from one user to millions
    Also means
    leader (in TAO)
    Source
  • leader election

    Choosing which process is the leader, the one that coordinates the steps of a distributed algorithm. It must leave at most one leader at any time, and finish even when there are failures. In one algorithm that Database Internals describes, an election starts when a process notices there is no leader, or the leader has stopped responding.

    First used in
    Single-leader and multi-leader replication
    Source
    • Database Internals, 1st edition, chapter 10: Chapter 10. Leader Election
    • Database Internals, 1st edition, chapter 10: Bully Algorithm
    • Understanding Distributed Systems, 2nd edition, chapter 9: Leader election
  • leaderless replication

    Replication with no leader: any replica accepts writes straight from clients, and a client writes to several nodes and reads from several at once, to detect and correct stale data. Riak and Cassandra work this way, after Dynamo, so it is also called Dynamo-style.

    Also called
    leaderless, masterless
    Taught in
    Tunable consistency and quorums
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 6: Leaderless Replication
    • Designing Data-Intensive Applications, 2nd edition, chapter 6: Summary
  • leaf page

    A page at the bottom of a B-tree. It holds individual keys, each with its value or with references to the pages where the values are kept.

    Taught in
    Storage engines: B-trees versus LSM-trees
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 4: B-Trees
  • leaky bucket

    A rate-limiting method. As NGINX applies it, requests above the set rate are held back and handled at that rate, and once more are waiting than the burst size allows, further ones are refused with an error.

    Taught in
    Reverse proxies and edge security
    Source
  • lease

    In Facebook's memcache, a token for one key, given to a client that missed and shown when it sets the value. The server checks it to decide whether to store the value, and the check fails if a delete has invalidated it. Handing out a key's tokens only once every 10 seconds also limits thundering herds.

    Taught in
    Cache invalidation and update strategies
    Source
  • least connections

    A way to spread requests: each one goes to the server that has the fewest active connections at that moment.

    Taught in
    Load balancing: layer 4 versus layer 7
    Source
  • LFU

    least frequently used

    An eviction policy that removes the item used least often. One such policy orders items by how often they are used rather than how recently.

    Taught in
    Eviction algorithms and memory management
    Source
    • Systems Performance, 2nd edition, chapter 2: 2.3.14 Caching
    • Database Internals, 1st edition, chapter 5: LFU
  • lifecycle rule

    A rule in an S3 Lifecycle configuration: an action S3 takes on a group of objects, such as moving them to another storage class a set number of days after they were created.

    Also called
    S3 Lifecycle
    Taught in
    Cost: compute, storage and network
    Source
  • linearizability

    As soon as a write completes, every client that reads the data must see the value just written.

    Also called
    strong consistency
    Taught in
    Consistency patterns
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 10: Linearizability
  • listener

    In an AWS load balancer, a process that checks for connection requests on the protocol and port you set. A load balancer with no listener receives no traffic.

    First used in
    Load balancing: layer 4 versus layer 7
    Source
  • Little's law

    On average, the number of requests in a system equals the arrival rate times the average time each spends there: L = λW. It holds for a whole system, or for its queue alone.

    Taught in
    Response time versus throughput
    Source
    • Systems Performance, 2nd edition, chapter 2: 2.6.5 Queueing Theory
  • LLM

    large language model

    The name for strong pre-trained language models, with tens to hundreds of billions of parameters each.

    First used in
    Batching and the KV cache
    Source
    • Hands-On LLM Serving and Optimization, 1st edition, chapter 2: LLM Evolution
  • load

    The work applied to a system, usually described as a rate: requests per second to a service, say, or gigabytes of new data a day.

    First used in
    Performance versus scalability
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 2: Understanding Load
    • Systems Performance, 2nd edition, chapter 2: 2.1 Terminology
  • load balancing

    Spreading requests across several instances of a service, running on different machines, any of which can handle a request.

    Taught in
    Performance versus scalability
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 5: Load balancers, service discovery, and service meshes
  • load testing

    A test that runs for a set length of time and then stops, with load generators configured for it. Real production traffic cannot be duplicated, so a load test aims to simulate reality as closely as possible.

    Taught in
    Step 4: Scale the design
    Source
    • Release It!, 2nd edition, chapter 3: Extending Your Life Span
    • Release It!, 2nd edition, chapter 15: Load Testing
  • locality

    An optimization for performance: keeping pieces of data that are often needed at the same time in the same place.

    Also called
    data locality
    Source
    • Designing Data-Intensive Applications, 2nd edition, glossary
  • lock

    A way to make sure only one thread, node or transaction can use something at a time; anyone else who wants it waits for the lock to be released.

    First used in
    Performance versus scalability
    Source
    • Designing Data-Intensive Applications, 2nd edition, glossary
  • log

    An append-only file for storing data. A write-ahead log makes a storage engine survive crashes, a log-structured storage engine keeps its data in logs, a replication log copies writes from a leader to its followers, and an event log can hold a stream of data; a message broker can keep its messages in one.

    Also called
    append-only log
    First used in
    Single-leader and multi-leader replication
    Source
    • Designing Data-Intensive Applications, 2nd edition, glossary
    • Designing Data-Intensive Applications, 2nd edition, chapter 12: Using logs for message storage
  • log shipping

    Moving a database's write-ahead log records directly from one server to another. In PostgreSQL the same capability is also called warm standby.

    Taught in
    Single-leader and multi-leader replication
    Source
  • log-based message broker

    A message broker that keeps messages in a log: a producer appends each message to the end, and consumers read the log in order; reading a message does not delete it. It joins the durable storage of a database with the quick notifications of messaging; Kafka is one.

    Also called
    log-based broker
    Taught in
    Queues, task queues and log-based message brokers
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 12: Log-Based Message Brokers
    • Designing Data-Intensive Applications, 2nd edition, chapter 12: Using logs for message storage
    • Designing Data-Intensive Applications, 2nd edition, chapter 12: Logs compared to traditional messaging
  • logical clock

    Instead of measuring time, an algorithm that counts events as they occur. Its timestamps do not tell the time, but comparing two of them shows which came first.

    Taught in
    Consensus and leader election: Raft and Paxos
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 10: Logical Clocks
  • logical replication

    Replication through a log kept apart from the storage engine's own format, usually recording writes to tables row by row. MySQL's binlog is such a log when set to row-based replication, and PostgreSQL implements logical replication by decoding its WAL.

    Also called
    logical log, logical replication log
    First used in
    Partition keys, skew and polyglot persistence
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 6: Logical (row-based) log replication
  • long polling

    A way for a server to send news to a client over HTTP: the server holds each request open instead of answering at once, and answers only when there is something to send.

    Taught in
    Connections that stay open
    Source
  • LoRA

    low-rank adaptation

    A way to adapt a model to a task by inserting small low-rank layers into it and training them, without changing its original weights. Several such LoRA adapters can be loaded in GPU memory at once, so that one model serving instance serves the requests of different adapters together.

    Also called
    adapter, LoRA adapter, multi-LoRA
    Taught in
    Throughput, cost and hosted models
    Source
    • Hands-On LLM Serving and Optimization, 1st edition, chapter 10: Multi-LoRA Serving
  • lost update

    When two clients each read a value, change it and write it back at the same time, and one write replaces the other without including its change, so that change is lost.

    Taught in
    Distributed transactions: two-phase commit and sagas
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 8: Summary
  • LRU

    least recently used

    An eviction policy that removes the item that has gone longest without being used. It keeps items in the order they were added, and moves an item to the back each time it is used again.

    Taught in
    Eviction algorithms and memory management
    Source
    • Systems Performance, 2nd edition, chapter 2: 2.3.14 Caching
    • Database Internals, 1st edition, chapter 5: FIFO and LRU
  • LSM-tree

    log-structured merge-tree

    A way of storing data that writes sorted files, never changes a file once written, and later merges files together. Storage engines built this way are often called LSM storage engines.

    Also called
    LSM
    First used in
    Denormalization and SQL tuning
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 4: Constructing and merging SSTables
  • Lucene

    The full-text indexing engine behind Elasticsearch and Solr. It keeps each term’s postings list in sorted files, like SSTables, and merges those files in the background.

    First used in
    Real-time search and scatter-gather
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 4: Full-Text Search

M

32 terms
  • M/M/1

    Markovian arrivals, Markovian service times, one server

    A queueing model with one server and unlimited room to wait, in which the arrival rate is lower than the server's service rate.

    Also called
    M/M/1 queue, M/M/1 model
    Taught in
    Response time versus throughput
    Source
  • MAC address

    media access control address

    Also called
    MAC
    First used in
    Load balancing: layer 4 versus layer 7
  • many-to-many relationship

    A relationship in which a record on either side can be linked to many on the other: a person may have worked at several companies, and each company employs many people.

    Also called
    many-to-many
    Taught in
    NoSQL data models and access patterns
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 3: Many-to-One and Many-to-Many Relationships
  • MapReduce

    A batch processing algorithm published by Google in 2004. A job runs two functions you write: a mapper, called once for every input record to extract a key and a value, and a reducer, called with all the values that belong to the same key.

    Taught in
    Redirects, caching and visit analytics
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 11: Chapter 11. Batch Processing
    • Designing Data-Intensive Applications, 2nd edition, chapter 11: MapReduce
  • materialized view

    A copy of the results of a query, written to disk. It has to be updated when the data under it changes. In event sourcing, materialized views (also called projections or read models) are brought up to date as each new event is added to the log.

    Also called
    read model
    Taught in
    Denormalization and SQL tuning
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 4: Materialized Views and Data Cubes
    • Designing Data-Intensive Applications, 2nd edition, chapter 3: Event Sourcing and CQRS
  • MB

    megabyte

    In computing, usually 1,048,576 bytes (2 to the 20th). The International System of Units makes a megabyte 1,000,000 bytes.

    First used in
    Back-of-the-envelope estimation
    Source
    • Systems Performance, 2nd edition, glossary
  • MD5

    Message Digest 5

    A hash function that takes a message of any length and produces a 128-bit message digest of it. MongoDB, for example, uses it to shard data.

    Taught in
    Step 3: Core components
    Source
  • median

    The halfway point of a list of response times sorted from fastest to slowest: with a median of 200 ms, half the requests take less than 200 ms and half take longer.

    Also called
    p50, 50th percentile
    First used in
    Fan-out on write, on read, or both
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 2: Average, Median, and Percentiles
  • memcache

    Facebook's name for its distributed caching system, as against Memcached, the program it runs. It takes read load off Facebook's databases: a web server asks memcache for a value, and if it is not cached, reads it from the database and adds it to the cache.

    Taught in
    Cache invalidation and update strategies
    Source
  • Memcached

    A key-value store held in memory, for small pieces of data such as what a database query or an API call returned.

    First used in
    Scaling from one user to millions
    Source
  • memory

    A system's primary memory storage, usually built from RAM.

    Also called
    main memory
    First used in
    Performance versus scalability
    Source
    • Systems Performance, 2nd edition, glossary
  • memory barrier

    What a program uses to make sure that writes become visible, in order, to threads running at the same time. Without one, a thread on one CPU core may not read a value that a thread on another core has just written, because every core keeps its own memory cache and store buffer.

    First used in
    Real-time search and scatter-gather
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 10: Linearizability and network delays
    • Database Internals, 1st edition, chapter 11: Sequential Consistency
  • memory hierarchy

    The kinds of storage ranked by size and by distance from the CPU: the fastest and closest are its registers, followed by caches, main memory, disk, tape and so on. Most databases work with two of its levels: slower disk and faster main memory.

    Taught in
    Caching tiers and cache placement
    Source
    • Release It!, 2nd edition, chapter 4: Off-Heap Memory, Off-Host Memory
    • Database Internals, 1st edition, chapter 5: Buffer Management
  • memory-bandwidth-bound

    Describes a task limited by how fast data moves within the system, such as between memory and processors; often called memory-bound. Chips with higher bandwidth can speed it up.

    Also called
    bandwidth-bound, memory-bound
    Taught in
    How a model answers a request
    Source
    • AI Engineering, 1st edition, chapter 9: Computational bottlenecks
    • AI Engineering, 1st edition, chapter 9: Terminology Ambiguity: Memory-Bound Versus Bandwidth-Bound
  • memtable

    The in-memory structure, kept sorted by key, into which an LSM-tree puts each write. Once it grows past a threshold, it is written out to disk, in key order, as an SSTable.

    Taught in
    Storage engines: B-trees versus LSM-trees
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 4: Constructing and merging SSTables
  • Merkle tree

    A tree of hashes over a replica's data: the lowest level hashes ranges of records, which can be as small as one key's value, as in Dynamo, and each level above hashes the level below it. Comparing two replicas' trees from the top down finds the ranges that differ.

    Also called
    hash tree
    Taught in
    Tunable consistency and quorums
    Source
  • message queue

    A server that programs send messages through, in effect a kind of database optimized for handling streams of messages.

    Also called
    message broker, broker
    First used in
    Scaling from one user to millions
    Also means
    queuequeue (data structure)
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 12: Message brokers
  • metadata

    Information about data rather than the data itself: for files, their contents are data, and what describes the files is metadata.

    First used in
    NoSQL data models and access patterns
    Source
    • Systems Performance, 2nd edition, chapter 8: 8.3.11 Metadata
  • metric

    A series over time of raw measurements of how a resource is used, such as CPU utilization, or of how something behaves, such as the number of requests that failed. Each sample is a number with a timestamp.

    First used in
    From one user to millions on AWS
    Source
    • Understanding Distributed Systems, 2nd edition, chapter 31: Metrics
  • microservice

    A small, independent service that runs as its own process on the network; many are put together to form a larger application. Microservices mainly let different teams make progress without coordinating with each other.

    First used in
    Event sourcing, CQRS and the transactional outbox
    Source
    • Distributed Systems (van Steen and Tanenbaum), 4th edition, chapter 2: Service-oriented architectures
    • Designing Data-Intensive Applications, 2nd edition, chapter 1: Microservices and Serverless
  • modulo hashing

    Choosing a key's node by taking its hash modulo the number of nodes. When the number of nodes changes, most of the keys have to move to another node.

    Also called
    mod N
    Taught in
    Horizontal sharding and consistent hashing
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 7: Hash modulo number of nodes
  • MongoDB

    A document database, one of those that made the document model popular.

    First used in
    NoSQL data models and access patterns
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 3: Relational Versus Document Models
  • monotonic reads

    A guarantee that a user who reads several times in a row never sees time go backward: after reading newer data, they do not read older data. It is weaker than strong consistency, and stronger than eventual consistency.

    Taught in
    Consistency patterns
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 6: Monotonic reads
  • Multi-AZ deployment

    In Amazon RDS, a Multi-AZ DB instance deployment: RDS keeps a standby replica of the database, updated synchronously, in another availability zone, and that standby cannot serve reads.

    Also called
    Multi-AZ
    Taught in
    From one user to millions on AWS
    Source
  • multi-leader replication

    Replication with more than one leader, each also acting as a follower of the others. Also called active/active or bidirectional replication.

    Also called
    multi-leader, master-master, master-master replication, multi-master, multi-master replication
    Taught in
    Availability patterns and failover
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 6: Multi-Leader Replication
  • multi-site active/active

    A disaster recovery strategy that runs the workload in several Regions at once, each serving traffic. It is the most complex and costly strategy, but, with the right technology choices and implementation, it can bring recovery time close to zero for most disasters; data corruption may still need backups.

    Taught in
    Multiple regions and disaster recovery
    Source
  • multiplexing

    In HTTP/2, carrying many requests on one connection at the same time, each request and its response on a stream of its own. The streams are largely independent, so one that is stalled does not hold up the rest.

    Taught in
    Transport protocols, gRPC and service meshes
    Source
  • multivalue answer routing

    A Route 53 routing policy that answers DNS queries with as many as eight healthy records, chosen at random.

    Also called
    multivalue answer
    Taught in
    Multiple regions and disaster recovery
    Source
  • mutex

    A mutual exclusion lock. Mutexes can become a performance bottleneck.

    First used in
    Back-of-the-envelope estimation
    Source
    • Systems Performance, 2nd edition, glossary
  • mutual TLS

    TLS with authentication in both directions, of the client as well as the server; TLS itself always checks the server's identity and only optionally the client's. With Amazon API Gateway, for example, clients present a certificate to prove who they are.

    Also called
    mTLS
    Taught in
    Transport protocols, gRPC and service meshes
    Source
  • MX

    mail exchange

    A DNS record that names a mail server for the domain: a host that accepts mail sent to its name.

    Also called
    MX record
    First used in
    DNS and global traffic routing
    Source
  • MySQL

    A relational database management system: it stores data in separate tables rather than all in one place.

    First used in
    Single-leader and multi-leader replication
    Source

N

21 terms

O

7 terms

P

53 terms

Q

5 terms

R

58 terms

S

87 terms

T

33 terms

U

15 terms

V

11 terms

W

27 terms

X

2 terms
  • XML

    Extensible Markup Language

    A widely supported text format for encoding data, which many programming languages can write and read. It is often criticized as verbose and needlessly complicated.

    First used in
    NoSQL data models and access patterns
    Source
    • Designing Data-Intensive Applications, 2nd edition, chapter 5: JSON, XML, and Binary Variants
    • W3C
  • XSS

    cross-site scripting

    A flaw that lets attackers put code of their own into an otherwise harmless website, which then runs in other users' browsers.

    First used in
    Reverse proxies and edge security
    Source

Z

2 terms