Access control list - An access control list, or ACL, is a set of entries describing access permissions associated with a resource.
Access Manager - In database architecture, an access manager is the part of a database management system that turns an execution plan into operations that access stored data.
Access Method - In database systems, an access method is a set of software routines that provides operations for a particular table or index structure.
ACID transactions - ACID transactions are database transactions designed around four properties: atomicity, consistency, isolation and durability.
Action schema - An action schema is a parameterized description of a type of action in an AI planning model.
Additive Rule - The additive rule, also called the union rule, is an inference rule for functional dependencies in relational database theory.
Address space - An address space is the set or range of addresses used to identify locations within a defined system.
Aggregate (data warehouse) - An aggregate in a data warehouse is a summary of more detailed records, usually stored to answer common analytical queries efficiently.
Aggregate Query - An aggregate query summarizes multiple database rows using functions such as COUNT, SUM, AVG, MIN or MAX.
Algorithmic skeleton - An algorithmic skeleton is a reusable structure for a family of computations, especially parallel computations.
All Key relation - An all-key relation is a relation whose key consists of all its attributes taken together.
All nearest smaller values - The all nearest smaller values problem finds, for every element in an ordered sequence, the closest earlier and closest later elements that are strictly...
All-to-all (parallel pattern) - All-to-all is a parallel communication pattern in which every participating process sends data to every participating process and receives data from each.
Amorphous computing - Amorphous computing studies how many simple computing elements can cooperate to produce an intended overall behavior despite irregular placement, local...
Anchor modeling - Anchor modeling is a database-modeling approach that separates stable identities, descriptive properties and relationships into small, highly normalized...
Application Defined Network - An application defined network is a networking approach in which application requirements help determine connectivity, traffic handling and related controls.
Approximate inference - Approximate inference uses computational methods to estimate quantities that are too difficult or expensive to calculate exactly within a model.
Array-sequenced organization - Array-sequenced organization stores fixed-length records at positions determined by numeric array indexes.
Asymmetric multiprocessing - Asymmetric multiprocessing, or AMP, is an arrangement in which processors or cores have different assigned roles or operate under separate management rather...
Atomic data types - Atomic data types are types whose values are treated as individual units by a particular data model or type system, rather than as collections or records...
Atomicity (database systems) - Atomicity in database systems is the property that a transaction's covered changes succeed as one unit or are discarded as one unit.
Attribute-based access control - Attribute-based access control, or ABAC, is an approach to authorization that evaluates attributes of the requester, the resource, the requested operation...
Attribute Preservation Property - The attribute preservation property requires the relation schemas in a decomposition to contain, collectively, every attribute of the original relation schema.
Attribute - value system - An attribute - value system represents a collection of objects through named attributes and their values.
Augmentation Rule - The augmentation rule is a basic inference rule for functional dependencies in relational database theory.
Author name disambiguation - Author name disambiguation identifies which author mentions in publication records refer to the same person.
Autocommit - Autocommit is a database connection or session mode in which successful statements are normally committed automatically, without the application separately...
Automatic mutual exclusion - Automatic Mutual Exclusion, or AME, is a concurrent programming model proposed by Michael Isard and Andrew Birrell in 2007.
Automatic parallelization - Automatic parallelization is the transformation of a program so that suitable work can run concurrently without the programmer manually organizing every...
Automatic vectorization - Automatic vectorization is a compiler optimization that converts suitable scalar operations into vector operations.
Autoscaling, horizontal - Horizontal autoscaling automatically increases or decreases the number of running instances that share a workload.
Autoscaling, vertical - Vertical autoscaling automatically adjusts the resources assigned to an individual workload instance, such as its CPU or memory allocation.
Availability zone - An availability zone is a cloud provider's designated group of one or more datacenters within a region, designed as a separate failure boundary.
Backup - A backup is a retained copy of data, or a recoverable representation of it, created so information can be restored after loss, corruption, unwanted change...
Barrier (computer science) - A barrier in concurrent computing is a synchronization point that coordinates a defined group of participants before they proceed.
Base relation - A base relation is a relation represented as stored data in a database rather than defined as the result of a query over other relations.
Batch processing - Batch processing runs a defined collection of work or data as a job, usually without requiring a person to interact with each individual item.
Big data ethics - Big data ethics examines the responsibilities and consequences involved in collecting, linking, analyzing, sharing and acting on large or complex datasets.
Big data maturity model - A big data maturity model is a framework for assessing how effectively an organization can manage and use large or complex datasets.
Binary Decomposition - Binary decomposition divides one relation schema into two relation schemas whose attributes collectively cover the original schema.
Bit-level parallelism - Bit-level parallelism is the ability to process multiple bits of information together within a machine operation.
Bitemporal modeling - Bitemporal modeling represents two time dimensions for a fact: when it is effective in the modeled world and when it is recorded as known by the system.
Bitmap index - A bitmap index is a database index that represents membership of rows in indexed values using sequences of bits.
Botnet - A botnet is a network of compromised computers or other connected devices that can be directed to perform activities for an unauthorized operator.
Bottom-up design - Bottom-up design, in the relational database context used here, develops a schema from detailed attributes and their dependency rules.
Boyce-Codd Normal Form - Boyce-Codd Normal Form, or BCNF, is a relational database normal form requiring every determinant in a nontrivial functional dependency to be a superkey.
Bring your own encryption - Bring your own encryption, or BYOE, describes arrangements in which an organization brings its own encryption capability and associated controls to protect...
Broadcast (parallel pattern) - Broadcast is a parallel computing communication pattern in which one participant distributes the same data to every participant in a specified group.