Which of the following best describes eventual consistency in distributed databases?
AAll nodes have identical data at all times
BData will be consistent across all nodes eventually, not immediately
CData consistency is never achieved
DOnly primary nodes maintain consistency
Correct Answer:
B. Data will be consistent across all nodes eventually, not immediately
Explanation:
Eventual consistency is a model in NoSQL and distributed systems where updates propagate asynchronously, achieving consistency over time rather than immediately.
In the context of graph databases, what is the primary advantage over relational databases for relationship-heavy queries?
ALower storage requirements
BFaster execution of complex relationship traversals
CBetter support for unstructured data
DSuperior ACID compliance
Correct Answer:
B. Faster execution of complex relationship traversals
Explanation:
Graph databases excel at querying relationships with O(1) traversal time, whereas relational databases require expensive JOIN operations for similar queries.
Which of the following is a non-relational database designed for handling unstructured data at scale?
AMongoDB
BPostgreSQL
COracle Database
DMySQL
Correct Answer:
A. MongoDB
Explanation:
MongoDB is a NoSQL document database that handles unstructured and semi-structured data efficiently, unlike relational databases like PostgreSQL, Oracle, and MySQL.