adplus-dvertising
frame-decoration

Question

Which statement is true regarding synonyms?

a.

Synonyms can be created for tables but not views

b.

Synonyms are used to reference only those tables that are owned by another user

c.

A public synonym and a private synonym can exist with the same name for the same table

d.

The DROP SYNONYM statement removes the synonym, and the status of the table on which the synonym has been created becomes invalid

Posted under Concurrency Control DBMS

Answer: (c).A public synonym and a private synonym can exist with the same name for the same table

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which statement is true regarding synonyms?

Similar Questions

Discover Related MCQs

Q. A non-correlated subquery can be defined as________

Q. Which statements are correct regarding indexes?

Q. Which of the following causes system to crash

Q. The database is partitioned into fixed-length storage units called

Q. The failure occurred sufficiently early during the transfer that the destination block remains intact.

Q. Which kind of failure loses its data in head crash or failure during transfer operation.

Q. The assumption that hardware errors and bugs in the software bring the system to a halt, but do not corrupt the nonvolatile storage contents, is known as the

Q. The transaction can no longer continue with its normal execution because of some internal condition, such as bad input, data not found, overflow, or resource limit exceeded. This is

Q. The system has entered an undesirable state (for example, deadlock), as a result of which a transaction cannot continue with its normal execution. This is

Q. Which of the following belongs to transaction failure

Q. Which one of the following is a failure to system

Q. The recovery scheme must also provide

Q. Instead of locking index leaf nodes in a two-phase manner, some index concurrency-control schemes use ___________ on individual key values, allowing other key values to be inserted or deleted from the same leaf.

Q. B-link tree requires a pointer to its __________ sibling.

Q. In crabbing protocol to inset or delete a key value the leaf node has to be locked in ___________ mode.

Q. If needed to split a node or coalesce it with its siblings, or redistribute key values between siblings, the crabbing protocol locks the parent of the node in ____________ mode.

Q. In crabbing protocol the the lock obtained on the root node is in _________ mode.

Q. The deadlock can be handled by

Q. In crabbing protocol locking

Q. How many techniques are available to control concurrency on B+ trees?