COST;

=======
1)If you are running a single query, the query’s cost will always be 100% as it is
a single query. However, if you are running more than 1 query, the cost will be
distributed among various queries.
2) Database Buffer Caches became larger. As a result, we spent less time reading
data off of disk, more time on the CPU.
3)Hard drives got faster. Hard drive time became less significant.
4)More CPU-intensive operations became introduced with more complex features.
5)Every query has a cost, which SQL Server records in the Execution Plan. This is
the cost assigned to the query by the optimizer.
6) While troubleshooting query performance in SQL Server, it is crucial to be are
aware of this cost.
7) In many cases, queries are sorting and hashing as a result of internal
operations.

INDEX;
========
1)An index contains keys built from one or more columns in the table or view.
2)These keys are stored in a structure (B-tree) that enables SQL Server to find the
row or rows associated with the key values quickly and efficiently.
3)SQL Server documentation uses the term B-tree generally in reference to indexes.
4)The CREATE INDEX statement is used to create indexes in tables.

5)Indexes are used to retrieve data from the database more quickly than otherwise.
6)The users cannot see the indexes, they are just used to speed up
searches/queries.

HINTS;
=======
1)Table hints are used to override the default behavior of the query optimizer
during the data manipulation language (DML) statement.
2)You can specify a locking method, one or more indexes, a query-processing
operation such as a table scan or index seek, or other options.
3)Used to force oracle to follow on execution plan according to the user.
4)select/*+full(employees)*/first_name from employees where first_name='neena';
5)select/*+index(employees idx1)*/first_name from employees where
first_name='neena';
6)a)b_tree index,b)bitmap index,c)composite index d)unique index,5)function based
index.