What will be the number of columns and rows respectively obtained for the operation, A- B, if A B are Base union compatible and all the rows of a are common to B? Assume A has 4 columns and 10 rows; and B has 4 columns and 15 rows
4,0
0,0
4,5
8,5
Correct Answer :
A. 4,0
Related Questions
HSAM stands for ……….
Hierarchic Standard Access Method
Hierarchic Sequential Access Method
Hierarchic Sequential and Method
Hierarchic Standard and Method
What are the desirable properties of a decomposition
Partition constraint.
Dependency preservation.
Redundancy.
Security.
Isolation of the transactions is ensured by
Transaction management
Application programmer
Concurrency control
Recovery management
The fact that all employees of a particular organization should not have salaries more than $10000 is a _____ constraint.
Schema
Tuple
Domain
Relational
In an ER model,_____ is described in the database by storing its data.
Entity
Attribute
Relationship
Notation
In E-R Diagram total participation is represented by
Double lines
Single line
Dashed lines
Triangle
_____clause is an additional filter that is applied to the result.
Select
Order by
Group-by
Having
A transaction is in state after the final statement has been executed.
partially committed
active
committed
none of the above
In SQL the word natural can be used with
inner join
full outer join
right outer join
all of the above
Which of the following is not a characteristic of a relational database model?
Table
Tree like structure
Complex logical relationship
Records
According to the levels of abstraction, the schema at the intermediate level is called
Logical schema.
Physical schema.
Subschema.
None of the above.
Data independence means
data is defined separately and not included in programs.
programs are not dependent on the physical attributes of data
programs are not dependent on the logical attributes of data
both B and C
Key to represent relationship between tables is called
primary key
secondary key
foreign key
none of the above
In multiple granularity of locks SIX lock is compatible with
IX
IS
S
SIX
Tree structures are used to store data in
Network model.
Relational model.
Hierarchical model.
File based system.
_______ product was acquired by Informix, integrated into its RDBMS and introduced as the Informix Universal Server an ORDBMS.
Star
llustar
SQL
Cygnus
The ______ indexes are forced to store only record IDs in the data structure and require at least one additional I/O Operation to retrieve the actual record.
Clustered
Hashed
Un-clustered
Collision
______is a preferred method for enforcing data integrity
Constraints
Triggers
Stored procedure
Cursors
DBMS helps achieve
Centralized control of data
Data independence
Both A and B
Neither A nor B
The metadata is created by the
DML compiler
DML pre-processor
DDL interpreter
Query interpreter
In SQL the statement select * from R, S is equivalent to
Select * from R natural join S.
Select * from R cross join S.
Select * from R union join S.
Select * from R inner join S.
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 values of the attribute describes a particular
Entity set
File
Entity instance
Organization
The collection of information stored in a database at a particular moment is called as ......
schema
instance of the database
data domain
independence
Which of the following is not comparison operator?
<>
<
=<
>=
Which of the following is true for network structure?
It is a physical representation of the data.
It allows many to many relationship.
It is conceptually simple.
It will be the dominant database of the future.
Processed data is called _____
Raw data
Source
Information
Useful data
A table can have only one
Secondary key
Alternate key
Unique key
Primary key
In an E-R, Y is the dominant entity and X is a subordinate entity. Then which of the following is incorrect :
Operationally, if Y is deleted, so is X
existence is dependent on Y.
Operationally, if X is deleted, so is Y.
Operationally, if X is deleted, & remains the same.
The rule that a value of a foreign key must appear as a value of some specific table is called a
Referential constraint.
Index.
Integrity constraint.
Functional dependency.