Access pattern
An access pattern is the characteristic or recurring manner in which a system or workload accesses data or other resources.
C++ Concurrency in Action, Second Edition
A data access pattern is the way a computation reads or writes locations in memory over time.
- How it is used
- Guides how concurrent work is divided and when workers should stop accessing data.
- How deep it goes
- Works through matrix thread assignments, then extends the reasoning to trees, mutex placement, and parallel search.
- Examples
- Uses row-contiguous matrix multiplication, a padded mutex layout, and parallel std::find with an atomic completion flag.
- What you can do after
- Diagnose/debug with it by identifying false-sharing risks in work assignments and unnecessary work in parallel searches.
Read how C++ Concurrency in Action, Second Edition explains access pattern →
Grokking Software Architecture
A repeatable way an application reads from and writes to its storage, including query shapes and read-to-write ratios.
- How it is used
- Uses access patterns as a primary factor in database selection.
- How deep it goes
- Defines access patterns and identifies query shapes, traffic ratios, payload sizes, latency tolerance, and lookup pathways as factors to examine.
- Examples
- Illustrates a cross-domain query for active Asian customer orders and their payment history.
- What you can do after
- Evaluate whether complex, cross-domain queries support choosing a relational database.
Read how Grokking Software Architecture explains access pattern →
CUDA for LLMs
A memory access pattern is the sequence and arrangement of memory locations read or written by a computation.
- How it is used
- Guides optimization of memory-bound GPU kernels by changing how threads access data.
- How deep it goes
- Traces thread-level addresses, memory transactions, reductions, and profiling results across naive and optimized kernels.
- Examples
- Traces GEMV row reads and partial sums, and profiles strided matrix reads in naive GEMM.
- What you can do after
- Diagnose/debug access patterns by comparing neighboring thread addresses and using NCU profiling to investigate performance regressions.
ScyllaDB in Action
A query pattern is a recurring form of data retrieval or mutation that an application must support.
- How it is used
- Guides data modeling and query design by expressing how an application repeatedly retrieves or mutates its data.
- How deep it goes
- Explains partition-key routing, cross-partition scans, and performance consequences through concrete CQL queries.
- Examples
- Uses restaurant-review lookups by restaurant, ordered_at, or both, including CQL output and a filtering warning.
- What you can do after
- Apply it via CQL by structuring data and queries around partition-key access instead of broad partition scans.
PostgreSQL Mistakes and How to Avoid Them
A usage pattern is a recurring way in which a database system or feature is configured or used.
- How it is used
- Uses recurring database behavior to identify inefficiencies, anomalies, bottlenecks, and opportunities for preventive improvement.
- How deep it goes
- Connects pattern recognition to review, analysis, staging tests, monitoring, and planned intervention, without prescribing detailed diagnostic commands.
- Examples
- Uses table bloat, billion-row growth, partitioning, cloud costs, connection limits, long transactions, autovacuum, locks, and indexes.
- What you can do after
- Diagnose emerging PostgreSQL problems and plan, test, monitor, and roll out corrective changes before they escalate.
Read how PostgreSQL Mistakes and How to Avoid Them explains access pattern →
Also covered in
- Privacy-Preserving Machine Learning
- Cloud Observability in Action
- MongoDB 8.0 in Action, Third Edition
- Fast by DefaultIn early access (MEAP)
- API Design Patterns
- Architecting an Apache Iceberg Lakehouse
- Grokking GPU ProgrammingIn early access (MEAP)
- Rust in Action: Systems programming concepts and techniques
What to know first
- SQLSQL is a standardized declarative language for defining, querying, and manipulating data in relational database systems.
- parallelismParallelism is the execution of multiple independent tasks or computational operations at the same time rather than sequentially.
- cache lineA cache line is a fixed-size block of contiguous memory that a cache transfers or manages as a unit.
- GPU memoryGPU memory is memory available to a graphics processing unit for storing data and state used in graphics or computation.
Related concepts
- effective memory bandwidthproduces · Effective memory bandwidth is the achieved rate at which a computation transfers data through memory, reflecting its memory-access efficiency rather than the memory system's peak rate.
- partition keyuses · A partition key is a value or attribute used to determine the partition to which a data item, record, or message is assigned or routed.
- reconstruction attackused by · A reconstruction attack attempts to recover original data, feature values, or source information from a model or transformed representation, often using auxiliary information.
Questions about access pattern
What is access pattern?
An access pattern is the characteristic or recurring manner in which a system or workload accesses data or other resources.
Which Manning books explain access pattern?
C++ Concurrency in Action, Second Edition, Grokking Software Architecture, CUDA for LLMs, ScyllaDB in Action and PostgreSQL Mistakes and How to Avoid Them.
What should I know before learning access pattern?
Manning books that teach access pattern usually introduce SQL, parallelism, cache line and GPU memory first.
What kinds of access pattern are there?
Kinds of access pattern include irregular access pattern and random access pattern.
What is access pattern also called?
Access pattern is also called query patterns.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.




