Sentinel value 2026-10-31
B+ tree Created 2026-10-31 Updated 2026-11-05
A B+ tree is a balanced search tree designed to keep each vertex in a storage database page. Internal vertices contain separator keys and child references; leaf vertices contain the indexed records or references to them. All leaves occur at the same depth, and linked leaves support ordered scans. PostgreSQL's index implementation illustrates this separation between leaf record references and internal downward references.[ref]
A large fan-out reduces storage accesses: with a fixed positive lower bound on nonroot internal fan-out, the height is . A database query first descends to the leaf containing a boundary key, then follows leaf links for a range. Separator keys guide navigation; their copies do not replace the leaf records.
For example, a root separator can direct keys below twelve to leaf and keys at least twelve to leaf . Searching for seventeen descends right. A range query from eight through seventeen starts in the left leaf and continues right. B+ tree node splits preserve the equal-depth structure as records are inserted.
Skip list 2026-10-31
A skip list stores an ordered sequence in a bottom linked list, with successively sparser linked lists above it. Searching moves right while the next key is too small, then down a level. Randomly chosen node heights give logarithmic expected search and update time complexity with a suitable height policy. Repeated keys require distinguishing equal-valued nodes by identity when removing their links.
List-based set representation 2026-10-31
Represent a finite set by a list of its elements. Allowing repeated elements makes set union cheap by list concatenation; imposing uniqueness requires membership checks. A representation sorted by a total order and containing no duplicates permits set union and set intersection by a simultaneous scan in linear time. These are different representation invariants for the same abstract set.
Session key 2026-10-31
A cryptographic key used for one communication session or bounded context. Its freshness and association with the intended peers need authentication; the fact that it arrives in an encrypted message does not by itself establish either property.
Cryptographic protocol Created 2026-10-31 Updated 2026-11-05
A cryptographic protocol specifies an interaction between parties using cryptographic operations to achieve a security property under stated assumptions. A key-exchange protocol, for example, aims to establish a shared secret while controlling what an adversary can learn or alter. Messages need meanings, order, identities and session context in addition to encryption or signatures. A sound primitive does not by itself make every composition secure: replaying a valid message in the wrong session can break an otherwise plausible exchange. Correctness and security depend on the adversary model and the exact transcript rules.
Dolev-Yao model 2026-10-31
A symbolic adversarial model of Danny Dolev and Andrew Yao granting control of the network while treating cryptographic operations as ideal constructors and destructors. An adversary may split unprotected tuples, replay messages and encrypt with known public keys, but cannot decrypt without the required key. Separate encrypted components are not automatically bound to adjacent clear fields.
Ciphertext-only attack 2026-10-31
An attack using observed ciphertexts without supplied corresponding plaintexts. Recognisable message redundancy or publicly testable relations can sometimes provide key-testing predicates.
Known-plaintext attack 2026-10-31
An attack using one or more known plaintext–ciphertext pairs, without necessarily controlling the plaintexts.
Chosen-plaintext attack 2026-10-31
An attack in which an adversary selects plaintexts and obtains their encryptions, possibly choosing later requests adaptively.
Exhaustive key search Created 2026-10-31 Updated 2026-11-05
Trying candidate keys and testing them against known plaintext–ciphertext pairs or another available verification condition. A uniformly selected key in a space of size appears at average position in a fixed enumeration.
Thread safety 2026-10-31
Process algebra 2026-10-31
A process algebra describes interacting systems through CSP events, composition operators and equations relating their behaviours. Communicating sequential processes is one such framework.
Communicating Scala Objects Created 2026-10-31 Updated 2026-11-05
A Scala library for constructing communicating concurrent processes with typed message-passing channels, parallel composition and guarded alternation.[ref]
Access control 2026-10-31
Rules and mechanisms deciding which subjects may perform which operations on protected objects. Discretionary access control permits designated owners to grant rights; the Bell-LaPadula model instead constrains information flow by classification.
Information confidentiality 2026-10-31
Protection against unauthorised disclosure of information. Access control can prevent a subject from reading a file, while cryptographic confidentiality protects message contents against specified adversaries using cryptography.
Data integrity 2026-10-31
Protection of data against unauthorised or accidental alteration. It is distinct from information confidentiality and service availability.
Trusted third party 2026-10-31
A participant whose correct behaviour and protection of secret state are assumptions of a security argument. It can mediate authentication and session key transport, but the protocol still needs to authenticate its responses.
Replay attack 2026-10-31
Reuse of previously observed valid messages to obtain an acceptance or action in a different context. Cryptographic nonces, fresh session keys and explicit context binding can prevent particular replay patterns.
Denial-of-service attack 2026-10-31
An attack on service availability by exhausting resources or preventing useful work. Requiring inexpensive unauthenticated messages to trigger expensive private-key operations creates an amplification opportunity.
There are unlisted articles, also show them or only show them.