h

t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
1
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
CS2029- ADVANCED DATABASE TECHNOLOGY
2-MARKS (QUESTIONS AND ANSWERS)
Unit 1
1.what are Armstrong axioms?(ApriI2010)
Armstrong's axioms are a set of axioms (or, more precisely, inference rules) used
to infer all the functional dependencies on a relational database.
2.what is cascade Iess scheduIe?(ApriI2010)
Every cascadeless schedule is also recoverable
t is desirable to restrict the schedules to those that are cascadeless
CascadeIess scheduIes cascading rollbacks cannot occur; for each pair of transactions
T
i
and T
j
such that T
j
reads a data item previously written by T
i
, the commit operation of T
i
appears before the read operation of T
j
.
Cascading roIIback a single transaction failure leads to a series of transaction rollbacks.
Consider the following schedule where none of the transactions has yet committed (so the
schedule is recoverable)
f T
10
fails, T
11
and T
12
must also be rolled back.
Can lead to the undoing of a significant amount of work
3.Define database management system?
Database management system (DBMS) is a collection of interrelated data and a set of programs to
access those data
4.Define data modeI?
A data model is a collection of conceptual tools for describing data, data relationships, data
semantics and consistency constraints.
5.What is an entity reIationship modeI?
The entity relationship model is a collection of basic objects called entities and relationship among
those objects. An entity is a thing or object in the real world that is distinguishable from other
objects
6.What are attributes? Give exampIes.
An entity is represented by a set of attributes. Attributes are descriptive properties possessed by each
member of an entity set.
ExampIe: possible attributes of customer entity are customer name, customer id, Customer Street,
customer city.
7.Distinguish between primary key with superkey.(Nov 2011)
Different set of attributes which are able to identify any row in the database is known as super
key. And minimal super key is termed as candidate key i.e. among set of super keys one with
minimum number of attributes. Primary key could be any key which is able to identify a specific
row in database in a unique manner.
8. Define the terms i) Entity set ii) ReIationship set
Entity set: The set of all entities of the same type is termed as an entity set.
ReIationship set : The set of all relationships of the same type is termed as a relationship set.
9. Define singIe vaIued and muItivaIued attributes.
SingIe vaIued attributes: attributes with a single value for a particular entity are called single valued
attributes.
http://csetube.weebly.com/
ERING
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
2
MuItivaIued attributes : Attributes with a set of value for a particular entity are called multivalued
attributes.
10.Define Data base Recovery(Nov 2011)?
Data recovery is the process of salvaging data from damaged, failed, corrupted, or inaccessible
secondary storage media when it cannot be accessed normally. Often the data are being
salvaged from storage media such as internal or external hard disk drives, solid-state drives
(SSD), USB flash drive, storage tapes, CDs, DVDs, RAD, and other electronics. Recovery may
be required due to physical damage to the storage device or logical damage to the file system
that prevents it from being mounted by the host operating system.
11. Define weak and strong entity sets?
Weak entity set: entity set that do not have key attribute of their own are called weak entity sets.
Strong entity set: Entity set that has a primary key is termed a strong entity set.
12. What does the cardinaIity ratio specify?
Mapping cardinalities or cardinality ratios express the number of entities to which another entity can be
associated. Mapping cardinalities must be one of the
following:
One to one
One to many
Many to one
Many to many
13. ExpIain the two types of participation constraint.
TotaI: The participation of an entity set E in a relationship set R is said to be totaI if every entity
in E participates in at least one relationship in R.
PartiaI: if only some entities in E participate in relationships in R, the participation of entity set E
in relationship R is said to be partiaI.
14. List the disadvantages of reIationaI database system
Repetition of data
nability to represent certain information.
15. What is first normaI form?
The domain of attribute must include only atomic (simple, indivisible) values.
16. What is meant by functionaI dependencies?
Consider a relation schema R and a C R and C R. The functional dependency a holds on
relational schema R if in any legal relation r(R), for all pairs of tuples t1 and t2 in r such that
t1 [a] =t1 [a], and also t1 [] =t2 [].
17. What are the uses of functionaI dependencies?
To test relations to see whether they are legal under a given set of functional dependencies.
To specify constraints on the set of legal relations.
18. What is meant by normaIization of data?
t is a process of analyzing the given relation schemas based on their Functional Dependencies
(FDs) and primary key to achieve the properties
Minimizing redundancy
Minimizing insertion, deletion and updating anomalies .
19. Define Boyce codd normaI form
A relation schema R is in BCNF with respect to a set F of functional + dependencies if, for all
functional dependencies in F of the form. a->, where a
20. ExpIain the desirabIe properties of decomposition.
Lossless-join decomposition
Dependency preservation
http://csetube.weebly.com/
ty are called multivaluedddddddddddddddddddddddddd
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
3
Repetition of information
21. What is 2NF?
A relation schema R is in 2NF if it is in 1NF and every non-prime attribute A in R
is fully functionally dependent on primary key
22. What is transaction?
Collections of operations that form a single logical unit of work are called transactions.
23. What are the two statements regarding transaction?
The two statements regarding transaction of the form:
Begin transaction
End transaction
24. What are the properties of transaction?
The properties o f transactions are:
Atomicity
Consistency
solation
Durability
25. What are the states of transaction?
The states of transaction are
Active
Partially committed
Failed
Aborted
Committed
Terminated
26. What is a shadow copy scheme?
t is simple, but efficient, scheme called the shadow copy schemes. t is based on making copies of
the database called shadow copies that one transaction is active at a time. The scheme also
assumes that the database is simply a file on disk.
27. What are the two types of seriaIizabiIity?
The two types of serializability is
Conflict serializability
View serializability
28. Define Iock?
Lock is the most common used to implement the requirement is to allow a transaction to access a
data item only if it is currently holding a lock on that item.
The modes of lock are:
Shared and Exclusive
29. Define the phases of two phase Iocking protocoI
Growing phase: a transaction may obtain locks but not release any lock.
Shrinking phase: a transaction may release locks but may not obtain any new locks.
30. Define upgrade and downgrade?
t provides a mechanism for conversion from shared lock to exclusive lock is known as upgrade.
t provides a mechanism for conversion from exclusive lock to shared lock is known as downgrade.
31. What is a recovery scheme?
An integral part of a database system is a recovery scheme that can restore the database to the
consistent state that existed before the failure.
32. Define bIocks?
The database system resides permanently on nonvolatile storage, and is partitioned into fixed-length
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
4
storage units called blocks.
33. What is meant by PhysicaI bIocks?
The input and output operations are done in block units. The blocks residing on the disk are
referred to as physical blocks.
34. What is meant by buffer bIocks?
The blocks residing temporarily in main memory are referred to as buffer blocks.
35. What is meant by Iog-based recovery?
The most widely used structures for recording database modifications is the log. The log is a
sequence of log records, recording all the update activities in the database. There are several types
of log records.
36. What are uncommitted modifications?
The immediate-modification technique allows database modifications to be output to the database while
the transaction is still in the active state. Data modifications written by active transactions are called
uncommitted modifications.
37. Define shadow paging.
An alternative to log-based crash recovery technique is shadow paging. This technique needs fewer
disk accesses than do the log-based methods.
38. ExpIain current page tabIe and shadow page tabIe.
The key idea behind the shadow paging technique is to maintain two page tables during the life of
the transaction: the current page table and the shadow p age table. Both the page tables are identical
when the transaction starts. The current page table may be changed when a transaction performs a
write operation.
39. What are the drawbacks of shadow-paging technique?
Commit Overhead
Data fragmentation
Garbage collection
40. Define garbage coIIection.
Garbage may be created also as a side effect of crashes. Periodically, it is necessary to find all
the garbage pages and to add them to the list of free pages. This process is called garbage
collection.
41. Differentiate strict two phase Iocking protocoI and rigorous two phase Iocking
protocoI.
n strict two phase Iocking protocoI all exclusive mode locks taken by a transaction is held until that
transaction commits.
Rigorous two phase Iocking protocoI requires that all locks be held until the transaction commits.
42. How the time stamps are impIemented
Use the value of the system clock as the time stamp. That is a transaction's time stamp is equal to the
value of the clock when the transaction enters the system.
Use a logical counter that is incremented after a new timestamp has been assigned; that is the time
stamp is equal to the value of the counter.
43. What are the time stamps associated with each data item?
W-timestamp (Q) denotes the largest time stamp if any transaction that executed WRTE (Q)
successfully.
R-timestamp (Q) denotes the largest time stamp if any transaction that executed READ (Q)
successfully.
44.What is query optimization?
Query optimization is a function of many relational database management systems in which multiple
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
S
query plans for satisfying a query are examined and a good query plan is identified.
45.what aretunabIe Parameters?
Tuning of hardware Tuning of schema Tuning of indices Tuning of materialized views Tuning of
transactions
Unit2
1.What is Iocation transparency and fragmentation transparency?
Distribution Transparency allows the user to perceive the database as a single,logical
entity.f a DDBMS exhibits distribution transparency,then the user does not need to know the data is
Fragmented(Fragmentation Transparency)or the location of data items(Location transparency)
2.When are eIections and voting used in distributed databases?
A voter database is a database containing information on voters for the purpose of assisting a
political party or an individual politician, in their Get out the vote (GOTV) efforts and other areas
of the campaign.
3.Name some partitioning techniques.
Round Robin, Hash partitioning, Range partitioning.
4. What are the cIassifications of the skew?
a. Attribute_value skew
b. Partition skew
5. What is Inter query paraIIeIism?
n nter query parallelism, different queries or transactions execute in parallel with one
another. This form of parallelism can increase transaction throughput.
6. What is Intra query paraIIeIism?
ntra query parallelism refers to the execution of a single query in parallel on multiple
processors and disks.
7.List the basic faiIure types of a distributed system.(Nov/Dec2011)
The Ioss of a message
The faiIure of a communication Iink.
The faiIure of a site
Network partitioning
8. Execution of a singIe query can be paraIIeIized in two ways. What are they?
a. ntra operation Parallelism
b. nteroperation Parallelism
9. What is data paraIIism?
Execution of the same operation in parallel on different sets of data is called data parallism.
10. Mention the types and uses of commit protocols.(Nov/Dec2011)
Two phase commit(2PC):Operates in 2 phases(Voting phase and a Decision Phase)
Three Phase Commit(3PC):it is a non-bIocking protocoI for site faiIures,except in the
faiIure of aII sites.
11.What are the two forms of interoperation paraIIeIism?
a. Pipelined parallelism
b. ndependent parallelism
http://csetube.weebly.com/
fied.
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
6
12. Write some approaches for storing the reIation in distributed data storage?
a. Replication
b. Fragmentation
c. Replication and fragmentation
13. Write the types of fragmentation?
a. Horizontal fragmentation, vertical fragmentation, mixed fragmentation.
14. Short notes on HorizontaI fragmentation.
The relation r is partitioned into a number of subsets r1,r2,.rn. Each tuple of relation r
must belong to at least one of the fragments, so that the original relation can be reconstructed, if needed.
To reconstruct fragment ri as follows:
i. ri=
where r is a global relation, pi is a predicate.
15. Short notes on verticaI fragmentation.
n its simplest form, vertical fragmentation is the same as decomposition. Each fragment ri of r is defined
by
ri=
we can reconstruct the relation r from the fragments by taking natural join
a. r=r1 r2 r3 r4 . rn
16. Write the issues of network transparency?
a. Naming of data items
b. Replication of data items
c. Fragmentation of data items
d. Location of fragments and replicas
17. Write the two disadvantages of naming of data items?
First, poor performance. Second, if the name server crashes, it may not be possible for any site in the
distributed system to continue to run.
18. What is a gIobaI and IocaI transaction?
The local transaction is those that access and update data in only one local database; the global
transaction is those that access and update data in several local database.
19.Write the subsystems of each site?
The transaction manager, the transaction coordinator
20. What are the faiIure types of a system?
Failure of a site
Loss of messages
Failure of a communication link
Network partition
21. What is distributed database?
A logically collection of shared data,distributed over computer network
22.What are the different ways for handIing the faiIure?
a. Retransmission of a message.
b. Reconfigure the system.
23. What is backup coordinator?
A backup coordinator is a site that, in addition to other tasks, maintains enough information locally to
allow it to assume the role of coordinator with minimal disruption to the distributed system. The main
difference between the coordinator and its backup is that the backup does not take any action that affects
other sites.
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
7
24. What is muItidatabase system?
Manipulation of information located in a heterogeneous database requires an additional
software layer on top of existing database system. This software layer is called multidatabase system.
25. What are the two types of transaction in a muItidatabase system?
Local transaction, Global transaction.
26. What is independent paraIIeIism?
Operations in a query expression that do not depend on one another can be executed in
parallel. This form of parallelism is called independent parallelism.
Unit 3
1.List out the ACID properties and give its uses?
The four basic ACD Properties of a transaction are
Atomicity:The 'all or nothing property.
Consistency:A transaction must transform the database from one consistent state to another
consistent state.
solation:Transaction execute independently of one another.
Durability:The effects of a successfully completed transaction are permanently recorded in
the database and must not be lost because of a subsequent failure.
2.Mention the approaches of object oriented database?
Extend an existing object-oriented programming language with database capabilities
Provide extensible object-oriented DBMS libraries.
Embed object-oriented database language constructs in a conventional host language.
Extend an existing database language with object oriented capabilities
Develop a novel database data model/data language.
3.What are the goaIs of OODB?
The goals of OODB are:
i) To maintain direct correspondence between real world and database object, so that
the object will not loose its integrity and identity.
ii) The objects, which are complex, need not be scattered in the database, and hence to
create complex object structures.
4. What are persistent objects and transient objects?
Objects in OOPL exist only during program execution and are hence called transient objects.
Objects in OODB can be extended, so that they can exist in permanent storage even after the program
termination. They are called persistent objects.
5. What is OID?
OO databases provide a unique system generated object-identifier (OD) for each
object. ts value is not visible to the external user and they are used to create and manage interobject
references.
6. What are the characteristics an OID possess? (What are the properties of OID?)
The characteristics of OD are:
iii) mmutable They do not change.
iv) An OD can be used only once.
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
8
7. What are the two components of object?
The two components of object are:
1) State(Value) and 2) Behavior(Operation).
8. Write the formaI structure of an object.
n object is normally represented as a triple O = (i, c, v)
i- The unique object identifier.
c- The type constructor.
v- The object state or current value.
9. What are the six type constructors?
The six type constructors are : Atom, Tuple, Array, List, Bag and Set.
Array, List, Bag and Set are called Collection types or Bulk types.
10. ExpIain each type constructor.
Atom f c is atom, the value v is atomic and it is supported by the system.
Set The ODs for the set of objects are of same type. This does not allow duplicates.
Array - The ODs for the set of objects are single dimensional array of object identifier.
List The list is similar to set, except that the ODs are ordered.
Bag Bag is also called multiset. This can also contain duplicate elements.
11.Mention the approaches used for making objects persistent.
Checkpointing
Serialization
Explicit paging
12.Mention the use of create iterator ( ) method used in ODMG C++ Ianguage.
create_iterator() to create an iterator
on the class extent
Also provides seIect(pred) method to return iterator
on objects that satisfy selection predicate pred.
terators help step through objects in a collection or
class extent.
Collections (sets, lists etc.) also provide
create_iterator() method
13. What are identicaI objects and equaI objects?
Two objects are said to have equal states, if their states at the atomic levels are the
same, but the values are reached through distinct objects.
Two objects are said to be in identical states, if the objects are identical even though the
objects themselves are not as they have distinct ODs.
14. What is encapsuIation?
Encapsulation is also called information hiding, which is related to the concepts of abstract data types.
This defines the behavior of a types of object based on the operation it has to perform.
The internal structure of object is hidden and the object is accessible only through the predefined
operations.
15. How can an operation be defined in encapsuIation?
The operation defined in encapsulation concept has two parts:
i) Signature or interface of the operation t specifies the operation name and
arguments.
ii) Method or Body of the operation t specifies the implementation of operation.
16. What are hidden and visibIe attributes?
Visible attributes are the attributes that may be directly accessed for reading by external
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
9
operators or by high-level query language. Hidden attributes are the attributes that are
completely encapsulated and can be only applied through predefined operations.
17. What is object constructor, destructor and object modifier?
Object constructors are the operations, which are used to create new object. Object
destructors are used to destroy objects. The object modifiers are the operations declared to modify
various attributes of an object.
18. What are the methods for creating persistent objects?
Persistent objects are the objects stored in databases that persist even after the program termination.
The techniques to create persistence objects are: Naming and reachability.
Naming mechanism involves giving an object a unique persistent name through which it
can be retrieved with this and other programs. The named persistent objects are the entry points to the
database.
The reachability mechanism works by making the object reachable from some other
persistent object. Making the object to be referenced by another persistent object B can make an object A
persistent.
19. What is inheritance?
nheritance is the concept of OO systems, that permits specification of new types or classes that inherit
their structure and operations from previously defines types or classes.
20. What is persistent coIIection?
f we first create a names persistent object N, whose state is a set or list of objects of
some class C, we can make the objects of C persistent by adding them to the set or list, and thus making
it reachable from N. This N defines the persistent collection of objects of C.
21. What is sub types and super type?
The subtype is the type, which must be formed from already existing type by inheriting
some of its features. The super type is the type from which the functions are inherited.
22. What is operator poIymorphism ?(Operator overIoading).
t refers to the operation's ability to be applied to different types of objects. The operation's name may
refer to each distinct implementation, depending on the type of objects it is applied to.
23. What is Iate binding?
f the type of object to which the function is applied is not known until runtime and in
this case the function must check the type of object and then invoke the appropriate method. This is
called late binding.
24. What is earIy binding?
f the types of object for invoking the function is known at the compile time itself it is said
to be early binding.
25. What is persistent coIIection and transient coIIection?
A persistent collection holds the collection of objects that is stored permanently in the
database and hence can be accessed and shared by multiple programs.
A transient collection exists temporarily during execution of program but is not kept
when the program terminates.
26. What are the two types of compIex objects?
The two types of complex objects are:
vii) Structured complex object
viii) Unstructured complex object.
27. What is a structured compIex object?
Structured complex object is made up of components that can be defined by applying
available type constructor recursively.
http://csetube.weebly.com/
hat are
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
10
28. What is unstructured compIex object?
Unstructured complex objects are the complex objects that typically require a large
amount of storage, such as a data type that requires a large amount of storage.
29. What is ownership semantics?
Ownership semantics applies when the sub-objects of complex object are encapsulated
within the complex object and are hence considered as part of complex object. This is also referred to as
"is-part-of or "is-component-of relationship.
30. What is reference semantics?
Reference semantics are applied when the components of the complex objects are
themselves independent objects but may be referenced from the complex object.
31. What is compIex object assembIy?
Storing the components of structured complex object on the same disk is called
complex object assembly.
32. Define muItipIe inheritance and seIective inheritance.
Multiple inheritance in a type hierarchy occurs when a certain subtype T is a subtype of two types and
hence inherits the functions of both supertypes.
Selective inheritance occurs when a subtype inherits only some of the functions of supertype.
33.What is ODMG modeI?
The ODMG Object Model is intended to allow portability of applicationsamong object database products.
t provides a common model for these productsby defining extensions to the OMG object model that
support object databaserequirements. n particular, the ODMG model extends the OMG core to
providefor persistent objects, object properties, more specific object types,queries and transactions.
34.What is JASMINE?
Jasmine is an object-oriented database codeveloped by Fujitsu and Computer Associates.
35.What is postgres?
Postgres is an object-oriented relational database management system (sometimes referred to as an
object-relational database). t began as a research project at the University of California, Berkely and is
available in several free and commercial versions today.
36.What do you meant by GEMSTONE?
GemStone is a proprietary application framework that was first available for Smalltalk as an object
database.GemStone Systems was founded in 1982 as Servio Logic, and then became GemStone
Systems, nc in 1995. GemStone developed its first prototype in 1982, and shipped its first product in
1986. The engineering group resides in Beaverton, Oregon. Three of the original co-founding engineers,
Bob Bretl, Allen Otis and Monty Williams, have been with the company since its inception.
Unit4
1.Define : SnowfIake schema and fact consteIIation.(ApriI/May 2011)
SnowfIake schema
The snowflake schema is a more complex data warehouse model than a star schema, and is a type of
star schema. t is called a snowflake schema because the diagram of the schema resembles a snowflake.
Snowflake schemas normalize dimensions to eliminate redundancy. That is, the dimension data has been
grouped into multiple tables instead of one large table.
Fact consteIIation
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
11
This Schema is used mainly for the aggregate fact tables, OR where we want to split a fact table for
better comprehension. The split of fact table is done only when we want to focus on aggregation over few
facts & dimensions.
2.What is the difference between XML schema and XML DTD? (ApriI/May 2011)
XML schema:The XML Schema is itself an XML document using elements and attributes to express
the semantics of the schema.
XML DTD:The Document Type Definition defines the valid syntax of an XML document by listing the
element names that can occur in the document,which elements can appear in combination with
which other ones,how elements can be nested what attributes are available for each element type.
3.EnIist the types of XML documents.(Nov/Dec2011)
4. Name the Iayers of 3-tier cIient-server architecture and give its functions. .(Nov/Dec2011)
5. Define Data mining
Data mining refers to the mining or discovery of new information in terms of
patterns or rules from vast amount of data.
6. Write the reIationship between data warehouse and data mining.
i) Data warehouse is aggregate and summarized collection of data that makes data mining
efficient.
ii) Data warehouse supports decision-making
iii) Data mining helps to extract meaningful new patterns
iv) Data mining can be applied to operational databases.
7. What are the different phases in KnowIedge discovery?
i) Data Selection Selecting data about specific item or category
ii) Data cleansing Correcting invalid data or eliminating records
iii) Enrichment Enhancing data with additional sources of information
iv) Data transformation and Encoding Reducing amount of data by generalization
v) Data mining Techniques to mine different rules and patterns
vi) Reporting and Display of discovered information Displaying result as listings, graphical
outputs, summary tables or visualizations in a user understandable manner
8. Why mining of association ruIes are more compIicated?
i) The relationship between item sets is very large and the volume of transaction is very high as well.
ii) Transactions show variations based on the factors like geographic locations, seasons and make
sampling difficult.
iii) tem classifications exist along multiple dimensions
iv) Quality of data is variable.
9. What is regression?
Regression is a similar approach to classification. f the classification rules is regarded as a function over
the variables that maps these variables into a target class variable, the rule is called regression rule.
10. What is cIustering?
Clustering is the data mining technique, that is directed towards goals of identification and classification. t
identifies the finite set of categories or clusters to which each data object can be mapped.
11. What are the appIications of data mining?
http://csetube.weebly.com/
o split a fact table for
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
12
i) Marketing
ii) Finance
iii) Manufacturing
iv) Health care
12.Define Data Warehouse.
Data warehouse is a subject-oriented, integrated, non-volatile, time-variant collection of data in support of
management's decisions. (OR) Data warehouse is a collection of decision support technologies, aimed at
enabling the knowledge worker to make better and faster decisions. (OR) Data warehouse is a repository
of information gathered from multiple sources, stored under a unified schema, at a single site.
13.What are the AppIications of Data warehousing?
i) OLAP (Online Analytical Processing)
ii) DSS (Decision Support System)/ES (Executive nformation Systems)
iii) Data Mining
14. What are the differences between reIationaI databases and data warehouse?
i) Relational databases support insertions and updates, while Data warehouse support
extraction, Processing, Analysis and decision-making.
ii) Relational database data may be distributed, while data warehouse is integrated data from multiple
sources.
15. What is onIine transaction processing?
OLTP supports transactions in distributed environment. t supports insertions, updates, deletions and
information query requirements.
16. What are the differences between transactionaI databases and data warehouse?
i) Transactional database provides access to disjoint and heterogeneous databases.
Data warehouse store integrated data from multiple sources in multidimensional model
ii)Transactional database support storage of historical data. Data warehouse support time-series and
trend analysis with historical data.
iii)Transactional databases are volatile Data warehouses are non-volatile.
iv)Transactional database units are records. Data warehouse information is coarse grained, and
subjected to incremental refreshing.
x) ntuitive data manipulation
xi) Consistent reporting performance
xii) Flexible reporting
17. What are the types of data warehouse?
i)Enterprise-wide data warehouse For huge projects with large investment and resources
ii)Virtual data warehouse Provide views of operational databases materialized for
efficient access.
iii)Data mart Data from any organization or department.
18. What are the two types of muItidimensionaI schemas?
i)Star schema t consists of fact table with single table for each dimension
ii)Snowflake schema The dimension tables from Star schema are organized
hierarchically by normalizing them.
(nclude the diagrammatic representation too)
19. Define Fact consteIIation.
Fact constellation is the set of tables that share sae dimension tables. They limit the possible queries for
the data warehouse.
(nclude the diagrammatic representation too)
20. What is indexing? What are the two types of indexing?
ndexing is the technique to improve high performance access. Two types are,
i) Bit map indexing t constructs a bit vector for each value in domain being indexed. A 1-bit will be
placed in jth position of corresponding bit vector, if jth row contains the domain being indexed.
ii) Join indexing This is used to maintain the relationships between primary key and foreign key.
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
13
21.What is a MobiIe Database System (MDS)?
A system with the following structural and functional properties
Distributed system with mobile connectivity
Full database system capability
Complete spatial mobility
Built on PCS/GSM platform
Wireless and wired communication capability
22.What is a mobiIe connectivity?
A mode in which a client or a server can establish communication with each other whenever
needed.Intermittent connectivity is a special case of mobile connectivity.
23.List MDS Query processing types
Location dependent query
Location aware query
Location independent query
24.Why Transaction and database recovery compIex in MDS.
Complex for the following reasons
Some of the processing nodes are mobile
Less resilient to physical use/abuse
Limited wireless channels
Limited power supply
Disconnected processing capability
25.List the features of Recovery in mobiIe database?
Desirable recovery features
ndependent recovery capability
Efficient logging and checkpointing facility
Log duplication facility
26. Is XML a database?
An XML document is a collection of data. t is self-describing (the markup describes the structure and
type names of the data, although not the semantics), t is portable (Unicode), and t can describe data in
tree or graph structures.
27.What are the Approaches to storing XML DocumentsApproaches to storing XML Documents?
Using DBMS to store the document as text. Using DBMS to store the document contents as data
elements. Designing a specialized system for storing native XML data. Creating or publishing customized
XML documents
28.List the ruIes of VaIid or WeII formed XML .
t should start with Xml declaration. t should have a single root element. t should be in accordance with
An XML document is well formed, if it follows few conditions XML DTD and XML Schema.
29.What is DTD?
DTD - Document type definitions
The element names used in the start and end tag pairs must follow a structure specified in a separate
file. This file can be either a DTD or and XML
30.Define XML Schema?
This is also a standard for specifying the structure of xml documents. Xml schema is based on the tree
data model.
31.What is X-Query?
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
14
XQuery is designed to be a small, easily implemental language in which the queries are easily
understood. of XML information sources, including both databases and documents. t is a human-
readable query syntax and an XML- based query syntax.
32.Mention the Requirements for a Database Web Interface?
Your database (Access, MySQL)
A Web server with appropriate RDBMS
A way of connecting the two
(Common Gateway nterface CG scripts and SQL)
Security concerns

Unit 5
1.What is the difficuIty in defining and maintaining controI ruIes?(Nov/Dec2011)
2. What are the sources of spatiaI data?(Nov/Dec2011)
3. Mention the types of spatiaI queries.(ApriI/May2011)
4. What is a horn cIause?(ApriI/May2011)
5. What is vaIid time and transaction time in temporaI databases?
The most natural interpretation is that the associated time is the time that the event
occurred, or the period during which the fact was considered to be true in the read world. f this
interpretation is used, the associated time is often referred to as the valid time. A temporal database
using this interpretation is called a valid time database. The different interpretation is used, that is, it is the
value of the system clock when the information is valid in the system. nthis case, the associated time is
called transaction time. A temporal database using thisinterpretation is called a transaction time
database.
6. List the types of spatiaI queries?
Range query, nearest neighbour query, spatial joins or overlays.
7. List some types of muItimedia data.
Text, graphics, animations, video, audio.
8.What is a MuItimedia DBMS?
A multimedia database management system (MM-DBMS) is a framework that manages different types of
data potentially represented in a wide diversity of formats on a wide array of media sources.
9. requirements of MuItimedia DBMS? What are the
*Persistence
Data objects can be saved and re-used by different transactions and program invocations
*Privacy
Access and authorization control
*Integrity control
Ensures database consistency between transactions
*Recovery
Failures of transactions should not affect the persistent data storage
*Query support
Allows easy querying of multimedia data
http://csetube.weebly.com/
eries are easily
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
1S
10.Write a query to Find aII image/video objects containing Big Spender wearing a purpIe suit.
This can be expressed as the SMDS-SQL query:
SELECT M
FROM smdssourcel M
WHERE (FindType(M)=Video OR FindType(M)=mage)
AND
M N FindObjWithFeatureandAttr(Big Spender, suit, purple)
11.How is MuItimedia Data different ?
Size
Capture Methods
Time Constraint like streaming
Querying
12.what are the Different Data Structures in MDBMS?
k-d trees
Quadtree
R-tree
13.write the properties of K-d trees?
Each node represents a rectilinear region
Each node associated with an axis
Direction of cutting plane alternate with depth
14.What are the types of Queries in MM-DBMS?
Whole Match Queries
Sub-pattern Match Queries
K-nearest Neighbour Queries
All Pair Queries or Sptial joins
15.Write a query to Find aII images containing Jane Shady and a person who appears in a video
with Big Spender. UnIike the preceding queries this query invoIves computing a "join" Iike
operations across different data domains. In order to do this, we use existentiaI variabIes such as
the variabIe "Person" in the query beIow, which is used to refer to the existence of an unknown
person whose identity is to be determined.
SELECT M,Person
FROM smdssourcel M,M1
WHERE (FindType(M)=mage) AND
(FindType(M1)=Video) AND
M N FindObjWithFeature(Jane Shady) AND
M1 N FindObjWithFeature(Big Spender) AND
Person N FindFeaturesinObj (M) AND
Person N FindFeaturesinObj (M1) AND
PersonJane Shady AND PersonBig Spender
16.What is active-DBMS?
An active database is a database in which some operations are automatically executed once a
given situation arises
The situation may correspond to the fact that:
Some specified events arise, or
Specific conditions or state transitions are detected
An active rule (trigger) is a language construct for defining the system reactions
17. How wiII you Create an active ruIe?:
CREATE TRIGGERName
{BEFORE | AFTER} EventONRelation
[REFERENCING{ OLD[ROW] [AS] Variable |NEW[ROW] [AS] Variable |
OLDTABLE [AS] Variable | NEWTABLE [AS] Variable}]
http://csetube.weebly.com/
earing a purpIe suit.
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
16
[FOR EACH {ROW | STATEMENT}]
[WHENCondition]
SQL Commands
18.How wiII you deIete an active ruIe?:
DROP TRIGGERName
19.what is spatiaI DB?
Spatial Database
Keep track of objects in a multi-dimensional space
Maps
Geographical nformation Systems (GIS)
Weather
n general spatial databases are n-dimensional
This discussion is limited to 2-dimensional spatial databases
20.what is deductive DB?
Deductive databases is a Declarative Language
Language to specify rules
nference Engine (Deduction Machine)
Can deduce new facts by interpreting the rules
Related to logic programming
Prolog language (Prolog =>Programming in Iogic)
Uses backward chaining to evaluate
Top-down application of the rules
21. Define Facts
Similar to relation specification without the necessity of including attribute names
22.DefineRuIes
Similar to relational views (virtual relations that are not stored)
23.What isPredicate?
Predicate has a name
a fixed number of arguments
Convention:
Constants are numeric or character strings
Variables start with upper case letters
E.g.SUPERVSE(Supervisor, Supervisee)
States that Supervisor SUPERVSE(s) Supervisee
24.Define KnowIedge Databases?
A knowIedge base (abbreviated KB, kb or A
[1][2]
) is a special kind of database for knowledge
management, providing the means for the computerized collection, organization, and retrieval of
knowledge. Also a collection of data representing related experiences, their results are related to their
problems and solutions
University 16 marks Questions
UNIT-I
1.Construct an E-R diagram for a hospital with a set of patients
and a set of medical doctors. Associate with each patient a log
of the various tests and examination conducted. (8)(Nov/Dec2011)
2.Devise a timestamp-based protocol that avoids the phantom
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
17
phenomenon. (8)(Nov/Dec2011)
3.Briefly explain the types of join operation in query processing with an
example for each. (16) (Nov/Dec2011)
4. (i) Discuss first normal form, second normal form and third normal
forms. (10) .(April/May2011)
(ii) Normalize the given relations as required. (6)
Customer (Customer - D, customer name, telephone numbers,
_ Credit cards) to first normal form.
[note : telephone numbers, credit - cards are multivalued
Attributes]
Student (roll no, name, course no, course max, marks, year of
study, Address) to third normal form.
vendor order (vendor no, order no, vendor name, qty supplied,
price/unit) to second normal form.
5.Discuss : .(April/May2011)
(i) Conflict serializability.
(ii) View serializability.
(iii) Two phase commit protocol.
(iv) Validation based concurrency control protocol.
UNIT-II
1. Discuss in detail how parallelism could be used in query processing and
relational operations executions. (16) (April/May2011)
2. Consider the relations : (10) (April/May2011)
employee (name, address, salary, plant-number)
machine (machine-number, type, plant-number)
Assume that the employee relation is fragmented horizontally by
plant-number, and that each fragment is stored locally at the
corresponding plant site. Assume that the machine relation is
stored its entirety at the Armonk site. Describe a good strategy for
processing each of the following queries.
Find all employees at the plant that contains machine number
1130.
Find all employees at plants that contain machines whose type
is ''milling machine''.
Find all machines at the almaden plant.
Compute join of find employee and machine relations.
3.Explain how 3PC responds to various types of failures. (6) (April/May2011)
4. How do you execute single query in parallel on multiple
processors? Explain it with suitable parallelism. (8)Nov/Dec2011)
5.Explain the concept and types of distributed query processing
with an example query for each. (8) (Nov/Dec2011)
6.Briefly explain the problems that occur during uncontrolled
concurrent execution. (16) (Nov/Dec2011)
UNIT-3
1. Discuss the basic built in interfaces of the ODMG model. (12)(April/May2011)
2.Differentiate :
Multiple inheritance and selective inheritance. (4) (April/May2011)
Structured and unstructured complex objects.
3.Describe the steps of the algorithm for object database design for
EER to OO mapping. (8) (April/May2011)
4.Discuss in detail the OQL concepts. (8) (April/May2011)
http://csetube.weebly.com/
h
t
t
p
:
/
/
c
s
e
t
u
b
e
.
t
k
/
18
5. Differentiate the following with respect to object oriented data
model:
(1) classes, subclasses and super classes
(2) regular inheritance, multi inheritance and selective
inheritance. (8)(Nov/Dec2011)
6.Discuss the concept of serializability with its types. (8) )(Nov/Dec2011)
7. Briefly address the conceptual issues when adding persistence to an
existing programming language. Also discuss the drawbacks and
complexity of persistent programming languages. (16) )(Nov/Dec2011)
UNIT-4
1.Devise an algorithm to classify the decision tree with its applications.
Also discuss the association rules and clustering concept with
respect to data mining. (16) (Nov/Dec2011)
2.With a neat sketch, explain the architecture, applications,
characteristics and data management issues with respect to mobile
databases. (16) (Nov/Dec2011)
3. Devise an algorithm to classify the decision tree with its applications.
Also discuss the association rules and clustering concept with
respect to data mining. (16)(April/May2011)
4.With a neat sketch, explain the architecture, applications,
characteristics and data management issues with respect to mobile
databases(16)(April/May2011)
UNIT-5
1. Compare and contrast active database with deductive database.
(8) (Nov/Dec2011)
2.Suggest a database for knowledge management and explain the
concept of knowledge retrieval with suitable examples. (8) (Nov/Dec2011)
3.Describe the types and applications of multimedia database. (8) (Nov/Dec2011)
4.Suggest a suitable database to keep track of objects in a multi
dimensional space and explain it with an example. (8) (Nov/Dec2011)
5. Discuss the database management issues involved in designing mobile,
genomic and multimedia databases. (16)(April/May2011)
6.Discuss the design and implementation issues for active databases.
(8)(April/May2011)
7.Discuss the programming aspects of Datalog with example. (8)(April/May2011)
http://csetube.weebly.com/