Q. Reducing the complexity of complex queries by similarly handling sub-queries is known as ______

View solution

Q. Which of the following is a multi-query optimization technique

View solution

Q. If a query is optimized without providing specific values for its parameters the technique is called __________

View solution

Q. A collection of data designed to be used by different people is called a/an

View solution

Q. Which of the following schemas does define a view or views of the database for particular users?

View solution

Q. Which of the following is an attribute that can uniquely identify a row in a table?

View solution

Q. Which of the following terms does refer to the correctness and completeness of the data in a database?

View solution

Q. The relationship between DEPARTMENT and EMPLOYEE is a

View solution

Q. A table can be logically connected to another table by defining a

View solution

Q. If the state of the database no longer reflects a real state of the world that the database is supposed to capture, then such a state is called

View solution

Q. Ensuring isolation property is the responsibility of the

View solution

Q. In query processing, the ___________ is the lowest-level operator to access data.

View solution

Q. In a ____________ the system scans each file block and tests all records to see whether they satisfy the selection condition.

View solution

Q. Index structures are referred to as __________ since they provide a path through which data can be located and accessed.

View solution

Q. Search algorithms that use an index are referred to as

View solution

Q. Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition.

View solution

Q. The strategy can retrieve a single record if the equality condition is on a key;multiple records may be retrieved if the indexing field is not a key is

View solution

Q. The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is

View solution

Q. The ___ algorithm scans each index for pointers to tuples that satisfy an individual condition.

View solution

Q. If access paths are available on all the conditions of a disjunctive selection, each index is scanned for pointers to tuples that satisfy the individual condition. This is satisfied by

View solution