Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
a. Construct a query around any one of the functional divisions you made in 4a such that if executed in the distributed design of 4 would require reconstruction of at least two horizontal and two vertical fragments, as well as a choice of one replica.
b. Using the centralised schema of 3, show an optimum query plan for your query.
c. Show two distributed query plans for your query. One assumes all data is transported to another site. The other plan achieves close to minimum data transport and use of at least one semijoin. Using the quantitative analysis of 2 and assumptions based on 3 and 4, estimate the cost of each plan in terms of bytes of data transmitted. Show your working.
d. Sketch a process to update the product catalogue. The process will have a coordinating transaction and subtransactions responsible for the product table, outlet table and the shopping cart. At least part of the product table will be replicated, so there will be a separate process for each replica. Use a synchronised replication protocol. The process will detail the messages sent from process to process and the read-item and write-item for each database access. Other aspects of the process can be briefly described in English.
Annotate the process with resource lock/unlock commands corresponding to a two-phase locking protocol. Justify your claim that the protocol is two-phase locking in your specific case.
What is a virtual table that draws its data from the result of an SQL SELECT statement? View is a virtual table that draws its data from the result of an SQL SELECT statement.
Rules Of Data Normalisation Let us now summarise Normalisation with the help of various clean rules. The following are the necessary rules for the Normalisation process: 1.
What is known as fudge factor? The number of partitions is enhanced by a small value called the fudge factor, which is usually 20 percent of the number of hash partitions compu
Define shadow paging. An alternative to log-based crash recovery method is shadow paging. This technique requires fewer disk accesses than do the log-based methods.
Timestamp Ordering Protocol A timestamp is a tag that can be attached to any transaction or any data item, which indicates a specific time on which the transaction or data item
From SAD to OOAD (Structured Analysis and Design (SAD) to Object Oriented Analysis and Design (OOAD). We will find here how we can map various models in SAD to different model
let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation
How does a query tree represent a relational algebra expression? Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is
Consider the subsequent relation schemes: Project (Project#, Project_name, chief_architect) Employee (Emp#, Empname) Assigned_To (Project#, Emp#) Give expression i
What is a hash index? A hash index organizes the search keys, with their associated pointers, into a hash file structure.
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd