Linear And Binary Search, Indexes, Views

Question 1

Identify

Are virtual tables created from a stored query. Allows you to access and manipulate data from one or more tables without rewriting the query each time.

Answer 1

SQL Views

Question 2

Identify:

Is a data structure the contains a copy of some of the data from one or more existing database tables

Answer 2

Indexes

Question 3

Formula:

Linear Search average search time

Answer 3

Average = (n+1)/2

Question 4

Formula:

Linear Search Maximum search time

Answer 4

Maximum = n

Question 5

Formula:

Binary search average search time

Answer 5

Average = log2 (n)-1

Question 6

Formula:

Formula for middle in binary search

Answer 6

N/2 + 1

Question 7

Identify:

Simple search algorithm that checks each element in a dataset one by one until the desired value is found or the end of the dataset is reached

Answer 7

Linear Search

Question 8

Identify:

Is a search algorithm that finds a target value in a sorted dataset by repeatedly dividing the search interval half

Answer 8

Binary Search

Question 9

Identify:

Provides an organizational framework that the DBMS can use to quickly locate the information that needs

Answer 9

Indexes

Question 10

Identify:

Is a virtual tables created created by a DBMS-stored SELECT statement which can combine access to data in multiple tables and even in other ways

Answer 10

SQL views

Question 11

Linear Search

Answer 11

Check each element in a dataset one by one until the desired value is found.

Question 12

SQL Views

Answer 12

SELECT statement which can combine access to data in multiple tables table and even in other views.

Question 13

Binary Search

Answer 13

Finds value in a sorted dataset dataset by repeatedly dividing the search interval in half.

Question 14

Indexes

Answer 14

Quickly locate the information that it needs.