BCNF handles edge cases in 3NF where anomalies can occur with composite candidate keys where determinants are not candidate keys themselves.
Binary search divides the search space in half with each iteration, resulting in O(log n) time complexity on sorted data.
PaaS provides a complete development and deployment environment in the cloud, including pre-configured tools and frameworks.
Hash tables use hash functions to map keys to indices, providing O(1) average-case lookup, insertion, and deletion operations.
ACID is a fundamental database property: Atomicity (all-or-nothing), Consistency (valid state), Isolation (concurrent independence), Durability (permanent after commit).
Quick Sort has O(n log n) average-case complexity, making it most efficient for random data. Though worst-case is O(n²), randomized pivot selection minimizes this risk.
AWS Auto Scaling automatically adjusts the number of EC2 instances based on demand metrics like CPU utilization or network traffic.
Linked lists require extra memory for storing pointers/references in each node, making them memory-inefficient compared to arrays.
Both syntaxes are valid in SQL. The first creates a composite index, while the second creates a unique composite index.
A B-tree of order m can have at most 2m-1 keys in any node and minimum m-1 keys in non-root nodes.