Database semantics - In AI logic, database semantics interprets a knowledge representation using assumptions that make its recorded facts describe a definite, bounded world.
Database transaction - A database transaction is a unit of work that groups database operations under defined completion and concurrency rules.
Database transaction schedule - A database transaction schedule is an abstract ordering of operations from one or more transactions.
Database virtualization - Database virtualization separates how a database is presented or managed from some details of its underlying resources.
Datafication - Datafication is the process of turning activities, relationships or phenomena into data that can be recorded, compared and analyzed.
Dataveillance - Dataveillance is the systematic monitoring or investigation of people through records about their activities or communications.
Deadlock prevention algorithms - Deadlock prevention algorithms are rules that stop a group of concurrent tasks from entering a circular wait in which none can proceed.
Decentralized application - A decentralized application, often shortened to dapp, is an application whose important operations run through a decentralized network rather than depending...
Decentralized autonomous organization - A decentralized autonomous organization, or DAO, is a group that coordinates decisions and shared resources using collectively defined governance...
Decentralized computing - Decentralized computing is an approach in which computing functions and some control over them are spread across multiple participants or nodes instead of...
Decomposition Algorithm - A decomposition algorithm is a systematic procedure for dividing a relation schema into smaller relation schemas to satisfy a chosen database normal form.
Deductive classifier - A deductive classifier is a reasoning system that determines classifications from formally stated knowledge and logical consequences.
Deductive databases - Deductive databases combine stored facts with logical rules that derive additional information when answering queries.
Deductive language - A deductive language is a language for expressing facts, relationships and logical rules so that a system can derive conclusions from them.
Deep Equality - Deep equality compares the contents of structured values beyond their outermost identity, following nested components according to a defined comparison rule.
Degenerate dimension - A degenerate dimension is a dimensional-modeling identifier kept directly in a fact table without a separate dimension table of descriptive attributes.
Degree of parallelism - Degree of parallelism is the number of execution participants used, or permitted, to work on an operation concurrently.
Deletion Anomaly - A deletion anomaly occurs when deleting a row to remove one fact unintentionally removes another independent fact that should remain represented in the...
Delta rule - The delta rule is an error-driven learning rule that adjusts a model's weights in the direction that reduces a squared-error objective.
Derived Relation - A derived relation is a relation obtained by applying an expression or query to other relations rather than treating its contents as independently supplied...
Digital curation - Digital curation is the active management of digital material throughout its lifecycle so that it remains understandable, trustworthy and usable for its...
Digital obsolescence - Digital obsolescence is the loss or weakening of practical access to digital material because the technologies needed to read, interpret or use it are no...
Dimensional fact model - The Dimensional Fact Model, or DFM, is a graphical conceptual model used to design data warehouses.
Disjoint pattern databases - Disjoint pattern databases are precomputed heuristic tables used in search problems, where suitable nonoverlapping subproblems provide lower-bound costs...
Distributed algorithmic mechanism design - Distributed algorithmic mechanism design studies how to design computationally practical rules for networked participants whose incentives may differ, when...
Distributed cache - A distributed cache is a caching system used across networked computers, commonly providing a shared cache service and often distributing cached items over...
Distributed computing - Distributed computing is the use of multiple networked computers or processes to perform a coordinated task or provide a service.
Distributed concurrency control - Distributed concurrency control coordinates overlapping operations or transactions on data managed across multiple networked nodes.
Distributed data store - A distributed data store is a system that stores and retrieves data across multiple networked machines.
Distributed database - A distributed database is a database whose data and database operations are managed across multiple networked nodes.
Distributed file system for cloud - A distributed file system for cloud is a file-storage system that uses multiple networked machines to provide file access for cloud or cloud-scale workloads.
Distributed ledger - A distributed ledger is a shared record maintained across multiple networked participants or nodes, using agreed rules to validate and incorporate changes.
Distributed memory - Distributed memory is a computer architecture or programming model in which processing units work with separate local memories and communicate to exchange...
Distributed transaction - A distributed transaction is a transaction whose work involves more than one networked resource or database participant.
DMAIC - DMAIC stands for Define, Measure, Analyze, Improve and Control.
Document-oriented database - A document-oriented database stores and queries records as structured documents, commonly containing named fields, nested objects and arrays.
Domain Constraint - A domain constraint restricts which values are valid for an attribute or type.
Dominant resource fairness - Dominant resource fairness, or DRF, is a resource-allocation rule that extends max-min fairness to several resource types.
DOPIPE - DOPIPE is a form of loop-level parallelism that divides work from a loop into cooperating pipeline stages.
Double-spending - Double-spending is an attempt or failure in which the same digital asset or spendable value is used more than once in conflicting transactions.
Durability (database systems) - Durability in database systems is the property that a committed transaction's effects survive the failures covered by the system's guarantee.
Dynamic SQL - Dynamic SQL is SQL whose statement text or structure is determined at runtime rather than being completely fixed in the program beforehand.
Early-arriving fact - An early-arriving fact is a measured business event that reaches a data warehouse before its full descriptive context is available.
Edge data integration - Edge data integration, in the business-user sense used here, connects data to meet a particular local need alongside centrally provided enterprise...
Elementary Domain - Elementary domain is a database-modeling term for a basic value domain, such as numbers, character strings, or dates, used as a building block for attributes.
Embarrassingly parallel - An embarrassingly parallel workload can be divided into tasks that run independently with little or no communication between them during computation.
Embedded analytics - Embedded analytics is the integration of analytical information and interactions into another application, portal or website.