Midterms - linear and binary search, indexes, views Flashcards
Identification
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
SQL views
Identification
Is a data structure that contains a copy of some of the data from one or more existing database tables
indexes
Formula
Linear Search average search time
average = (n+1) / 2
Formula
Linear Search maximum search time
maximum = n
Formula
Binary Search average search time
average = log2 (n)-1
Formula
Formula for middle in binary search
n/2 + 1
Identification
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
linear search
Identification
is a search algorithm that finds a target value in a sorted dataset by repeatedly dividing the search interval in half
binary search
Identification
provides an organizational framework that the DBMS can use to quickly locate the information that it needs
indexes
Identification
is a virtual table created by a DBMS-stored SELECT statement which can combine access to data in multiple tables and even in other views
SQL views
linear search
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
SQL views
is a virtual table created by a DBMS-stored SELECT statement which can combine access to data in multiple tables and even in other views
binary search
is a search algorithm that finds a target value in a sorted dataset by repeatedly dividing the search interval in half
indexes
provides an organizational framework that the DBMS can use to quickly locate the information that it needs
