If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
left outer join
right outer join
full outer join
inner join
Correct Answer :
D. inner join
Related Questions
The normalization was first proposed by .
Code
Codd
Boyce Codd
Boyce
If a transaction T has obtained an exclusive lock on item Q, then T can
read Q
write Q
both read and write Q
write Q but not read Q
Which of the following is not comparison operator?
<>
<
=<
>=
The fact that all employees of a particular organization should not have salaries more than $10000 is a _____ constraint.
Schema
Tuple
Domain
Relational
Which of the following is not a recovery technique?
Deferred update
Immediate update
Two-phase commit
Shadow paging
Which one is true statement :
With finer degree of granularity of locking a high degree of concurrency is possible.
Locking prevents non-serializable schedules.
Locking cannot take place at field level.
An exclusive lock on data item X is granted even if a shared lock is already held on X.
______ keyword is used to find the number of values in a column.
TOTAL
ADD
COUNT
SUM
A weak entity has an ______ dependency on its owner entity, which can be used for both ON UPDATE and ON DELETE.
Direct
Indirect
Existence
No
According to the levels of abstraction, the schema at the intermediate level is called
Logical schema.
Physical schema.
Subschema.
None of the above.
Which of the following is not a characteristic of a relational database model?
Table
Tree like structure
Complex logical relationship
Records
Which of the following is a reason to model data?
Understand each user's perspective of data
Understand the data itself irrespective of the physical representation
Understand the use of data across application areas
All of the above
Dependency preservation is not guaranteed in
BCNF
3NF
PJNF
DKNF
The middleware databases in which the business rules act are applicable to _______ tier architectures
Single
Three
Two
None
A logical schema
is the entire database
Describes how data is actually stored on disk.
is a standard way of organizing information into accessible parts.
All of the above
The normal form that is not necessarily dependency preserving is
2NF
3NF
BCNF
4NF
The keyword to eliminate duplicate rows from the query result in SQL is
DISTINCT
NO DUPLICATE
UNIQUE
None of the above
The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more columns is
View
Order by
Group by
Having
______is a preferred method for enforcing data integrity
Constraints
Triggers
Stored procedure
Cursors
Data items grouped together for storage purposes are called a
record
string
title
list
The fact that information in the data warehouse changes far less often and may be regarded as non-real-time with periodic updating; This implies that data warehouses are _______
Volatile
Non - Volatile
Logical
Physical
What are the desirable properties of a decomposition
Partition constraint.
Dependency preservation.
Redundancy.
Security.
Manager salary details are hidden from the employee .This is
Conceptual level data hiding.
External level data hiding.
Physical level data hiding.
None of these.
The statement that is executed automatically by the system as a side effect of the modification of the database is
backup
assertion
recovery
trigger
A DBMS is a ____ user if at most one user can use the system and is mostly restricted to personal computer systems.
None
Multi
Single
Concurrent
Shadow paging has
no redo
no undo
redo but no undo
neither redo nor undo
A ____ key specifies a uniqueness constraint that no two distinct tuples in any state r of relation R can have the same value for super key.
Sub
Parent
Candidate
Super
The full form of GUI is _________
Government Union Internet
Graphical Unit Interface
Graphical User Interface
Graphical University Interface
_____clause is an additional filter that is applied to the result.
Select
Order by
Group-by
Having
DFD stands for
Data Flow Document
Data File Diagram
Data Flow Diagram
Non of the above
Which is the best file organization when data is frequently added or deleted from a file?
Sequential
Direct
Index sequential
None of the above