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!
Describe a technique for direct search? Explain how data is stored within a file so which direct searching can be performed.
For a file of unordered fixed length records by using unspanned blocks and contiguous allocation, it is straight forward to access any record through its position in the file. If the file records are numbered 0,1,2,---,r-1 and the records in every block are numbered 0,1,---bfr-1; whereas bfr is the blocking factor, then ith record of the file is situated in block [(i/bfr)] and is the (I mod bfr) record in that block. Such a file is frequent known as a relative or direct file because records can simply be accessed directly through their relative positions. Accessing a record based on a search condition; thus, it facilitates the construction of access paths on the file, like as the indexes.
Horizontal Fragmentation- Horizontal fragmentation groups together the tuples in a relation that are collectively used by the main transactions. A horizontal fragment is produced b
What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER
Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a
what factors might influence a company to outsource its IT infrascture.
What is a Phantom Deadlock? In distributed deadlock detection, the delay in propagating local information might cause the deadlock detection algorithms to recognize deadlocks
Mention various steps required to draw an E-R Diagram. Draw an E-R Diagram for Student Information System. Mention all suitable assumptions to justify your answer.
Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.
#question.ERD of any car
Outer Join: The use of Outer Join is that it still joins those tuples that do not have matching values in common columns are also contained in the result table. Outer join places
Question: (a) Discuss the difference between a composite key and a composite attribute. How would each be indicated in an E-R diagram? Support your answer with appropriate exam
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