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!
Define physical and logical data independence. How does this architecture help in achieving these?
Data independence entails that change in one view must not need a change in the view(s) above. There are two sorts of data independence: logical and physical. The meaning of Logical data independence is that the conceptual view can be changed without influencing the existing external view, that is a given record may be spilt or combined along with other records but the external views need not be modified to reflect this. The meaning of Physical data independence is that the physical storage structures or devices employed to store the data can be changed without effecting the existing conceptual view or external view, that is if earlier indexed sequential files are employed to store data and then the B- trees are used, even then the upper layers must not be effected.
Give the general form of SQL query? Select A1, A2............., An From R1, R2..............., Rm Where P
what do you mean by primary key constraint?
Differentiate between join and outer join? Outer joins return all rows from at least one of the tables or views mentioned within the FROM clause, as long as those rows get toge
employee(empid,empname,dept,telno,mobno, add,sssno,tinno,WEdates,WEcomp,WEadd,WEpos,WEres) this is a employee record which is need to be normalize.the WE means work experience
Define a property that is not a property of transactions? Ans: Concurrency is not a property of transactions
Retrieve the S&S In-Chapter Database (in Microsoft Access format) from the text's Web site (or create the tables in Table 4-5 in a relational DBMS product). Write queries to answer
Multi-Key File Organisation In this part, we will introduce two basic file Organisation schemes that permit records to be accessed by more than one key field, therefore, allowi
Compare wait-die deadlock prevention scheme with wait-wound scheme Ans: Wait-Die Scheme a) Based upon a nonpreemptive technique. b) If Pi requests a resource present
Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap
Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.
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