CCP Relational & NoSQL Database Design 3

Question 1

Which indexing structure is most efficient for range queries on numerical data in relational databases?

Accepted Answer

B-tree index

Answer

B-tree indexes store data in sorted order, making them ideal for range queries since rows within a range can be traversed sequentially.

Question 2

In an entity-relationship (ER) diagram, a weak entity is characterized by:

Accepted Answer

Lacking a primary key on its own and depending on a strong entity

Answer

A weak entity cannot be uniquely identified by its own attributes alone and relies on the primary key of a related strong entity for identification.

Question 3

Which NoSQL database type is best suited for storing and querying highly connected data such as social networks?

Accepted Answer

Graph database

Answer

Graph databases use nodes and edges to represent and traverse relationships, making them optimal for highly connected data like social networks.

Question 4

What is denormalization in database design?

Accepted Answer

Intentionally introducing redundancy to improve read performance

Answer

Denormalization deliberately adds redundant data or groups data to reduce costly joins and improve query read performance at the cost of increased storage and update complexity.

Question 5

Which SQL clause is used to filter grouped results after a GROUP BY operation?

Accepted Answer

HAVING

Answer

The HAVING clause filters the results of aggregate functions applied to groups, unlike WHERE which filters individual rows before grouping.

(CCP) Certified Computing Professional Practice Test

(CCP) Certified Computing Professional Practice Test

CCP Relational & NoSQL Database Design 3