Queries within an unsorted database are slow because the only algorithm for searching an unsorted table requires a sequential look at each record.

Name: Queries within an unsorted database are slow because the only algorithm for searching an unsorted table requires a sequential look at each record.
Brand: Quizplus
Rating: 4.7 (39 reviews)

Question

Quizplus · Accepted Answer

Searching an unsorted table requires a sequential look at each record, which makes queries slow.

Queries Within an Unsorted Database Are Slow Because the Only