Skip to content

Persistent Data Management — Glossary

TermMeaning
ACIDAtomicity, consistency, isolation, and durability properties of transactions
Active domainValues that actually occur in a database instance or query constants
AttributeNamed property/column of an entity or relation
Attribute closureAttributes implied by an attribute set under functional dependencies
B+ treeBalanced index tree with all data entries in linked leaves
BCNFNormal form in which every non-trivial FD determinant is a super key
Candidate keyMinimal set of attributes uniquely identifying a tuple
CardinalityRelationship mapping ratio or, in query plans, estimated/result row count
Cascadeless scheduleSchedule in which transactions read only committed values
CheckpointRecovery marker that limits log scanning
Clustered indexIndex whose order determines or closely matches row storage order
CommitSuccessful durable completion of a transaction
ConflictSame item, different transactions, with at least one write
Conflict serializabilityEquivalence to a serial schedule by swapping non-conflicting operations
CursorMechanism for processing query results one row at a time
Data independenceAbility to change one schema level with little/no impact above it
DDLSQL commands that define schema objects
DeadlockCycle of transactions each waiting for another
Dense indexIndex with an entry for every search-key value/record
DomainPermitted set of values for an attribute
DRCRelational calculus whose variables range over domain values
DurabilityCommitted transaction effects survive failure
EntityDistinguishable real-world object
Entity integrityPrimary-key values cannot be null
Execution planPhysical operators chosen to run a query
Foreign keyAttribute set referencing a candidate key in another/same relation
FragmentationSplitting a distributed relation horizontally, vertically, or both
Functional dependencyConstraint X→Y in which X values determine Y values
HashingMapping a key to a bucket using a hash function
HDFSDistributed, replicated block-oriented Hadoop file system
IndexAuxiliary access structure that speeds data retrieval
IsolationDegree to which concurrent transactions are separated
JoinOperation combining related tuples from relations
LockConcurrency-control claim on a data resource
Lossless joinDecomposition whose join reconstructs exactly the original relation
Materialized viewPhysically stored result of a query
MVDMultivalued dependency expressing independent sets of values
MVCCConcurrency method maintaining multiple data versions
NormalizationDecomposing relations to reduce redundancy and anomalies
OptimizerDBMS component that selects an estimated low-cost plan
PhantomNew/deleted qualifying row observed when a predicate is repeated
Precedence graphDirected conflict graph used to test serializability
Primary keyCandidate key chosen as the main tuple identifier
ProjectionRelational operation selecting attributes/columns
Query selectivityFraction of input rows retained by a predicate
Recoverable scheduleDependent transaction commits only after the source writer commits
Referential integrityForeign key matches a referenced value or permitted null
RelationSet of tuples over named attributes; represented as a table
Relational algebraProcedural formal language of relation operations
Relational calculusDeclarative formal query language based on logic
ReplicationMaintaining copies of data at multiple sites
RollbackUndoing transaction changes
Safe expressionCalculus query guaranteed a finite, domain-restricted result
ScheduleInterleaving of transaction operations preserving each transaction's order
SelectionRelational operation choosing rows that satisfy a predicate
SerializabilityCorrectness criterion requiring effect equivalent to a serial order
Sparse indexOrdered index containing entries for only selected keys/pages
SparkDistributed DAG-based data-processing engine
Spurious tupleIncorrect tuple introduced by joining a lossy decomposition
Strict scheduleUncommitted writes cannot be read or overwritten by another transaction
Super keyAny attribute set that uniquely identifies a tuple
Timestamp orderingConcurrency protocol enforcing a timestamp-based serial order
TransactionLogical unit of database work
TriggerProgram automatically fired by a database event
TRCRelational calculus whose variables range over tuples
Two-Phase CommitDistributed atomic-commit protocol with prepare and decision phases
Two-Phase LockingProtocol with a lock-growing phase followed by a shrinking phase
ViewNamed stored query presenting a virtual table
WALWrite-ahead logging: log reaches stable storage before corresponding data
Weak entityEntity identified using an owner key plus a partial key

Built from Markdown with VitePress.