1.

DISTRIBUTED DATABASE
STEP 1:Create a databases in different servers.
STEP 2: Create three tables namely Books, BookStore, Stock.
STEP 3:The zip should ranges from 1 to 99999 in bookstore table.
STEP 3.1:The zip should ranges from 1 to !""" in bookstore table for site1.
STEP 3.2:The zip should ranges from !""1 to !"""" in bookstore table for site.
STEP 3.2:The zip should ranges from !"""1 to #!""" in bookstore table for site$.
STEP 3.2:The zip should ranges from #!""1 to 99999 in bookstore table for site%.
STEP 4&'nsert values in to corresponding tables.
STEP 5&Create federated tables to access the data from remote sites.
STEP 6& ()ecute *ueries for each table and display output.
RESULT:
Thus the distributed database for a bookstore +ith four sites is created
and the output is displayed.
2. IMPLEMENTATION OF DEADLOCK
DETECTION ALGORITHM USING WAIT FOR
GRAPH
AIM:
To implement deadlock detection algorithm using +ait for graph in distributed
algorithm.
ALGORITHM:
STEP 1:Create a table for customer +ith respect to given data.
STEP 2:,pdate the details of customer for given customer'd.
STEP 3:Commit transaction -.
STEP 4:Create a table for order relevant to the data.
STEP 5:,pdate the details of orders using ordered.
STEP 6:Commit transaction B.
STEP 7:,sing Try .catch determine the errors in the transactions.
STEP 8:'f any error occurs then perform rollback.
STEP :(nd the transactions
RESULT:
Thus the deadlock is determined using +ait/for graph.
3.OB!ECT ORIENTED DATABASE
AIM: "
To implement 0uery optimizer +ith 1elational algebraic e)pression for
processing the given *uery.
ALGORITHM: "
STEP 1: The algebraic rules are used to transform *ueries e)pressed in relational
algebra into e)pressions.
STEP 2 : . The cascading rule for selection to break up the con2unctions in
selection conditions. The result is a single selection transformed into a
se*uence of selection operators.
STEP 3: The previous step leads 'n pushing selections through 2oins and
Cartesian products.
STEP 4: Combine the Cartesian product operations +ith selections to form 2oins.
STEP 5 : ,se the associativity rules for 2oins and Cartesian products to rearrange
the order of 2oin operations.
RESULT:
Thus 0uery optimizer +ith 1elational algebraic e)pression for
processing the given *uery is implemented successfully.
%. PARALLEL DATABASE
AIM
To develop a parallel database for university counseling for engineering colleges at three sites and
accessing simultaneously.
PROCEDURE
1. Create database at three site.
. Create tables at $ sites.
a. Create for table for colleges at each site and another table for each college for department
details.
$. 'nsert the values for each table correspondingly at each site.
%. ,pdate the vacancy details after each allocation of seat.
!. -ccess the database simultaneously using 34'5 operation.
RESULT:
Thus the parallel database for university counseling has been created at three different sites and
simultaneously data +as accessed and seat +as allocated.
5. STUDENT MARK INFORMATION S#STEM USING
PARALLEL DATABASE
AIM
To develop a parallel database for student mark lists for engineering colleges at three sites and
accessing them simultaneously and order them based on their marks in each discipline.
PROCEDURE
1. Create database at three sites.
. Create tables at $ sites.
a. Create for table for colleges at each site and another table for each college for department
and marks details.
$. 'nsert the values for each table correspondingly at each site.
%. 6erge records of all the table using parallel database..
!. -ccess the database parallel and order them based on their marks in each discipline .
RESULT:
Thus the parallel database for Student 6ark lists has been created at three different sites and
simultaneously data +ere accessed and ordered +ith respect to their marks.
7. ACTIVE DATABASE
AIM:
To create a trigger and assertion for bank database handling deposits and loan
and admission database handling seat allocation and vacancy position.
PROCEDURE:
Step 1: Start the process
Step 2: Create the tables bank, deposit and loan for bank database
Step 3: Display the description of the table bank, deposit and loan
Step 5: nsert the val!es in the table bank
Step ": #hen a deposit is made by a c!stomer, create a trigger for !pdating
c!stomers acco!nt and bank acco!nt$
Step %: Display the table after e&ec!ting trigger
Step ': Create a trigger for !pdating c!stomer(s loan acco!nt and bank acco!nt,
#hen a loan is iss!ed to the c!stomer,
Step ): Display the table after e&ec!ting the trigger
Step 1*: Create assertion for bank database so that the total loan amo!nt does not
e&ceed the total balance in the bank$
RESULT:
Th!s the triggers and assertions has been created and e&ec!ted$
# D$%&'()*$ D+(+,+-$
AIM:
Toconstruct a kno+ledge database for kinship domain 8family relations9 +ith facts using
the concepts of deductive databases.
SPECIFICATIONS USED:
R&.$-:
They specify virtual relations that are not actually stored but that can be formed
from the facts by applying inference mechanisms based on the rule specifcations.
F+'(- :
Facts are specifed in a manner similar to the way relations are specifed,
except that it is not necessary to include the attribute names.
PROLOG NOTATIONS:
- :rolog system contains a number of built"inpredicates that the system can
interpretdirectly.
These typically include the e*uality comparison operator ;8X, Y9,+hich
returns true if X and Y are identical and can also be +ritten as X;Y by usingthe
standard infi) notation.
4ther comparison operators for numbers, such as <,<;, =, and =;, can be
treated as binary predicates.
-rithmetic functions such as >,?, @, and A can be used as arguments in
predicates in :rolog.
R$-&.(:
The given relations are e)tracted using rules and implemented using prolog and the
concepts of deductive databases.
8. WEKA TOOL
AIM:
To perform classify and cluster operation using +eka tool.
ALGORITHM:
STEP"1 : Start the process.
STEP"2 : 4pen the +eka tool.
STEP"3 : Select B()plorerC.
STEP"4 : Click B4pen fileC.
STEP"5 : Select the file +hich contains the dataset +ith the e)tension
.arff8attribute file format9.
STEP"6 : Choose BfilterC from the +eka tool.
STEP"7 : Select the options BSupervisedC then B-ttributeC and BDescretizeC.
STEP"8 : Click BapplyC for the filter in the +eka tool for BDiscretizationC.
STEP" : Choose BClassifyC and BfunctionC to select function BS64C8Se*uencing
6inimal 4ptimization9 then apply BTraining setC.
STEP"1/ : Click BStartC for the classify in the +eka tool.
STEP"11 : Choose BEisualizationC, select the )/a)is from the dataset field and
y/a)is from the dataset for another field.
STEP"12 : Stop the process.
RESULT:
Thus the above program +as e)ecuted successfully and the output +as verified.
. 0UER# PROCESSING
AIM: "
To implement 0uery optimizer +ith 1elational algebraic e)pression for
processing the given *uery.
ALGORITHM: "
STEP 1: The algebraic rules are used to transform *ueries e)pressed in relational
algebra into e)pressions.
STEP 2 : . The cascading rule for selection to break up the con2unctions in
selection conditions. The result is a single selection transformed into a
se*uence of selection operators.
STEP 3: The previous step leads 'n pushing selections through 2oins and
Cartesian products.
STEP 4: Combine the Cartesian product operations +ith selections to form 2oins.
STEP 5 : ,se the associativity rules for 2oins and Cartesian products to rearrange
the order of 2oin operations.
RESULT:
Thus 0uery optimizer +ith 1elational algebraic e)pression for
processing the given *uery is implemented successfully.
1. XML
AIM:
To Design F6G Schema for the given company database
PROCEDURE :
1. !pen editix"xml editor
2. #lic$ on File"%&ew 'ocument
3. choose standard xml document
4. Type the following coding for the ()* and save them.
5. +o to XML -> XPATH VIEW / XQuer !u"#$er
%. ,xecute the (path and (-ueries as below.
RE&ULT :
Thus ()* -ueries were executed using (./T0 and (12,34 for the
given company database.